Bounds on the Threshold of Linear Programming Decoding

Details Bounds on the Threshold of Linear Programming Decoding Bounds on the Threshold of Linear Programming Decoding

2006-02-26

arxiv.org/abs/cs/0602087v1

Proc. IEEE Information Theory Workshop (ITW 2006), Punta del Este, Uruguay, March 13-17, 2006

Computer Science

Information Theory

Scientific paper

Whereas many results are known about thresholds for ensembles of low-density
parity-check codes under message-passing iterative decoding, this is not the
case for linear programming decoding. Towards closing this knowledge gap, this
paper presents some bounds on the thresholds of low-density parity-check code
ensembles under linear programming decoding.

Affiliated with

Also associated with

No associations

Rating

Bounds on the Threshold of 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 Bounds on the Threshold of Linear Programming Decoding, we encourage you to share that experience with our LandOfFree.com community. Your opinion is very important and Bounds on the Threshold of Linear Programming Decoding will most certainly appreciate the feedback.

Rate now

Comments { 0 }

Profile ID: LFWR-SCP-O-6333