By Topic

A low-rate bound for asymmetric error-correcting codes (Corresp.)

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)

We prove a Plotkin-type bound for binary codes which correct asymmetric errors. This bound shows that it is possible to correct as many as1/3asymmetric errors per code symbol, and no more. The result is obtained by estimating the solution of a linear program.

Published in:

Information Theory, IEEE Transactions on  (Volume:29 ,  Issue: 4 )