By Topic

A note on p -nary adjacent-error-correcting codes

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)

Binary group codes described by Abramson permit the correction of all single errors and all double errors in adjacent digits, with the use of significantly fewer check digits than codes capable of correcting all double-bit errors. This note considers the generalization of Abramson's codes to thep-nary case, where a symbol alphabet consisting of the digits0, 1, cdots , p - 1is used for transmission,pbeing a prime number. Examples of suchp-nary codes are given, as well as necessary conditions for their existence. These codes bear the same relation to thep-nary Golay codes as Abramson's codes do to the familiar Hamming codes. Some as yet unanswered questions are raised, and suggestions for further possible generalizations are given.

Published in:

Information Theory, IRE Transactions on  (Volume:6 ,  Issue: 1 )