Polytope Representations for Linear-Programming Decoding of Non-Binary Linear Codes

Details Polytope Representations for Linear-Programming Decoding of Non-Binary Linear Codes Polytope Representations for Linear-Programming Decoding of Non-Binary Linear Codes

2007-12-25

arxiv.org/abs/0712.4075v2

Computer Science

Information Theory

5 pages, to appear in 2008 IEEE International Symposium on Information Theory

Scientific paper

In previous work, we demonstrated how decoding of a non-binary linear code could be formulated as a linear-programming problem. In this paper, we study different polytopes for use with linear-programming decoding, and show that for many classes of codes these polytopes yield a complexity advantage for decoding. These representations lead to polynomial-time decoders for a wide variety of classical non-binary linear codes.

Affiliated with

Also associated with

No associations

Rating

Polytope Representations for 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 Polytope Representations for 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 Polytope Representations for Linear-Programming Decoding of Non-Binary Linear Codes will most certainly appreciate the feedback.

Rate now

Comments { 0 }

Profile ID: LFWR-SCP-O-184994