Correcting a Fraction of Errors in Nonbinary Expander Codes with Linear Programming
Information Theory
2016-11-17 v2 math.IT
Abstract
A linear-programming decoder for \emph{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 \delta_A \delta_B (where \delta_A and \delta_B are the relative minimum distances of the constituent codes).
Cite
@article{arxiv.0906.1565,
title = {Correcting a Fraction of Errors in Nonbinary Expander Codes with Linear Programming},
author = {Vitaly Skachek},
journal= {arXiv preprint arXiv:0906.1565},
year = {2016}
}
Comments
Part of this work was presented at the IEEE International Symposium on Information Theory 2009, Seoul, Korea