Linear-programming Decoding of Non-binary Linear Codes

Details Linear-programming Decoding of Non-binary Linear Codes Linear-programming Decoding of Non-binary Linear Codes

2007-07-30

arxiv.org/abs/0707.4360v2

Computer Science

Information Theory

6 pages, 1 figure, 7-th International ITG Conference on Source and Channel Coding (SCC'08)

Scientific paper

We develop a framework for linear-programming (LP) decoding of non-binary linear codes over rings. We prove that the resulting LP decoder has the `maximum likelihood certificate' property, and we show that the decoder output is the lowest cost pseudocodeword. Equivalence between pseudocodewords of the linear program and pseudocodewords of graph covers is proved. LP decoding performance is illustrated for the (11,6,5) ternary Golay code with ternary PSK modulation over AWGN, and in this case it is shown that the LP decoder performance is comparable to codeword-error-rate-optimum hard-decision based decoding.

Affiliated with

Also associated with

No associations

Rating

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

Rate now

Comments { 0 }

Profile ID: LFWR-SCP-O-359241