Polytope Representations for Linear-Programming Decoding of Non-Binary Linear Codes
Information Theory
2016-11-18 v2 math.IT
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.
Cite
@article{arxiv.0712.4075,
title = {Polytope Representations for Linear-Programming Decoding of Non-Binary Linear Codes},
author = {Vitaly Skachek and Mark F. Flanagan and Eimear Byrne and Marcus Greferath},
journal= {arXiv preprint arXiv:0712.4075},
year = {2016}
}
Comments
5 pages, to appear in 2008 IEEE International Symposium on Information Theory