DocumentCode :
939392
Title :
A product construction for perfect codes over arbitrary alphabets (Corresp.)
Author :
Phelps, Kevin T.
Volume :
30
Issue :
5
fYear :
1984
fDate :
9/1/1984 12:00:00 AM
Firstpage :
769
Lastpage :
771
Abstract :
A general product construction for perfect single-error-correcting codes over an arbitrary alphabet is presented. Given perfect single-error-correcting codes of lengths 
, and 
over an alphabet of order 
, one can construct perfect single-error-correcting codes of length 
over the same alphabet. Moreover, if there exists a perfect single-error-correcting code of length over an alphabet of order , then there exist perfect single-error-correcting codes of length 
, 
, and 
, an integer). Finally, connections between projective planes of order and perfect codes of length over an alphabet of order are discussed.
, and over an alphabet of order , one can construct perfect single-error-correcting codes of length over the same alphabet. Moreover, if there exists a perfect single-error-correcting code of length over an alphabet of order , then there exist perfect single-error-correcting codes of length , , and , an integer). Finally, connections between projective planes of order and perfect codes of length over an alphabet of order are discussed.Keywords :
Error-correction coding; Automatic control; Binary sequences; Decoding; Error correction codes; Hamming distance; Particle separators; Process control;
fLanguage :
English
Journal_Title :
Information Theory, IEEE Transactions on
Publisher :
ieee
ISSN :
0018-9448
Type :
jour
DOI :
10.1109/TIT.1984.1056963
Filename :
1056963
Link To Document :
