By Topic

Correcting a Fraction of Errors in Nonbinary Expander Codes With Linear Programming

Sign In

Cookies must be enabled to login.After enabling cookies , please use refresh or reload or ctrl+f5 on the browser for the login options.

Formats Non-Member Member
$31 $13
Learn how you can qualify for the best price for this item!
Become an IEEE Member or Subscribe to
IEEE Xplore for exclusive pricing!
close button

puzzle piece

IEEE membership options for an individual and IEEE Xplore subscriptions for an organization offer the most affordable access to essential journal articles, conference papers, standards, eBooks, and eLearning courses.

Learn more about:

IEEE membership

IEEE Xplore subscriptions

1 Author(s)
Skachek, V. ; Claude Shannon Inst., Univ. Coll. Dublin, Dublin, Ireland

A linear-programming decoder for nonbinary expander codes is presented. It is shown that the proposed decoder has the nearest-neighbor 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).

Published in:

Information Theory, IEEE Transactions on  (Volume:57 ,  Issue: 6 )