Correcting a Fraction of Errors in Nonbinary Expander Codes with Linear Programming
Abstract
A linear-programming 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).
0
Turn this paper into a lesson
ArcXiv compiles a structured reading guide from this paper's metadata: plain-English importance, contributions, prerequisite concepts, which sections to read first, flashcards, and a quiz. Grounded in the abstract, never invented.