By Topic

Nonbinary AN codes with distance not less than five (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
$33 $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)

Recently Kondratyev and Trofimov obtained a theorem for binary AN codes with distance not less than five. In this correspondence we prove that this theorem holds for arbitrary nonbinary radix. Noting that the generalization of Peterson's theorem on single-error-correcting binary AN codes to nonbinary cases does not seem to be easily forthcoming the result described here is surprising.

Published in:

IEEE Transactions on Information Theory  (Volume:19 ,  Issue: 1 )