Adaptive Methods for Linear Programming Decoding

Details Adaptive Methods for Linear Programming Decoding Adaptive Methods for Linear Programming Decoding

2007-03-24

arxiv.org/abs/cs/0703123v1

Computer Science

Information Theory

22 pages, 8 figures. Submitted to IEEE Transactions on Information Theory

Scientific paper

Detectability of failures of linear programming (LP) decoding and the potential for improvement by adding new constraints motivate the use of an adaptive approach in selecting the constraints for the underlying LP problem. In this paper, we make a first step in studying this method, and show that it can significantly reduce the complexity of the problem, which was originally exponential in the maximum check-node degree. We further show that adaptively adding new constraints, e.g. by combining parity checks, can provide large gains in the performance.

Affiliated with

Also associated with

No associations

Rating

Adaptive Methods for Linear Programming Decoding does not yet have a rating. At this time, there are no reviews or comments for this scientific paper.

If you have personal experience with Adaptive Methods for Linear Programming Decoding, we encourage you to share that experience with our LandOfFree.com community. Your opinion is very important and Adaptive Methods for Linear Programming Decoding will most certainly appreciate the feedback.

Rate now

Comments { 0 }

Profile ID: LFWR-SCP-O-360883