On LP decoding of nonbinary expander codes

Authors:
Vitaly Skachek
Affiliations:
Claude Shannon Institute and School of Mathematical Sciences, University College Dublin, Belfield, Dublin 4, Ireland
Venue:
ISIT'09 Proceedings of the 2009 IEEE international conference on Symposium on Information Theory - Volume 1
Year:
2009

Citing 11
Cited 1

Decoding error-correcting codes via linear programming

Decoding error-correcting codes via linear programming
LP decoding achieves capacity

SODA '05 Proceedings of the sixteenth annual ACM-SIAM symposium on Discrete algorithms
Linear-programming decoding of nonbinary linear codes

IEEE Transactions on Information Theory
Linear-time encodable and decodable error-correcting codes

IEEE Transactions on Information Theory - Part 1
On expander codes

IEEE Transactions on Information Theory
Error exponents of expander codes

IEEE Transactions on Information Theory
Using linear programming to Decode Binary linear codes

IEEE Transactions on Information Theory
Concatenated codes: serial and parallel

IEEE Transactions on Information Theory
Distance properties of expander codes

IEEE Transactions on Information Theory
Improved Nearly-MDS Expander Codes

IEEE Transactions on Information Theory
LP Decoding Corrects a Constant Fraction of Errors

IEEE Transactions on Information Theory

Performance bounds for nonbinary linear block codes over memoryless symmetric channels

IEEE Transactions on Information Theory

Quantified Score

Hi-index	0.06

Visualization

Abstract

A linear-programming (LP) decoder for nonbinary expander codes is presented. It is shown that the proposed decoder has the maximum-likelihood certificate properties. It is also shown that this decoder corrects any pattern of errors of a relative weight up to approximately 1/4δAδB (where δA and δB are the relative minimum distances of the constituent codes).