Polytope representations for linear-programming decoding of non-binary linear codes
Skachek, V.
Flanagan, M.F.
Byrne, E.
Greferath, M.
Claude Shannon Inst., Univ. Coll. Dublin, Dublin;
This paper appears in: Information Theory, 2008. ISIT 2008. IEEE International Symposium on
Publication Date: 6-11 July 2008
On page(s): 1508-1512
Location: Toronto, ON,
ISBN: 978-1-4244-2256-2
INSPEC Accession Number: 10156127
Digital Object Identifier: 10.1109/ISIT.2008.4595239
Current Version Published: 2008-08-08
Abstract
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.
Index
Terms
Available to subscribers and IEEE members.
References
Available to subscribers and IEEE members.
Citing Documents
Available to subscribers and IEEE members.
Cart
