By Topic

A product construction for perfect codes over arbitrary alphabets (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

1 Author(s)

A general product construction for perfect single-error-correcting codes over an arbitrary alphabet is presented. Given perfect single-error-correcting codes of lengths n, m , and q + 1 over an alphabet of order q , one can construct perfect single-error-correcting codes of length (q - 1)nm + n + m over the same alphabet. Moreover, if there exists a perfect single-error-correcting code of length q + 1 over an alphabet of order q , then there exist perfect single-error-correcting codes of length n , n = (q^{t} _ 1)/(q - 1) , and (t > 0 , an integer). Finally, connections between projective planes of order q and perfect codes of length q + 1 over an alphabet of order q are discussed.

Published in:

IEEE Transactions on Information Theory  (Volume:30 ,  Issue: 5 )