By Topic

Multi-Error Correcting Codes for a Binary Asymmetric Channel

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

2 Author(s)

Many binary channels currently in use exhibit highly asymmetric transmission characteristics. In such a channel, it may be sufficient to correct only those errors which result from incorrect transmission of one of the two code elements. The minimum distance requirement for a pair of i-tuple, error correcting code characters in such a case is weaker than in the case of a symmetric channel. This weaker requirement is used to generate codes which generally contain more code characters for a given length than codes designed for use in a symmetric channel. The resulting code is symbol-correcting rather than message-correcting.

Published in:

Circuit Theory, IRE Transactions on  (Volume:6 ,  Issue: 5 )