DocumentCode
905223
Title
Maximum distance 
-nary codes
Author
Singleton, Richard C.
Volume
10
Issue
2
fYear
1964
fDate
4/1/1964 12:00:00 AM
Firstpage
116
Lastpage
118
Abstract
A -nary error-correcting code with 
code words of length 
can have no greater minimum distance 
than 
. The class of codes for which 
is studied first in general, then with the restriction that the codes be linear. Examples and construction methods are given to show that these codes exist for a number of values of 
, and 
.
-nary error-correcting code with code words of length can have no greater minimum distance than . The class of codes for which is studied first in general, then with the restriction that the codes be linear. Examples and construction methods are given to show that these codes exist for a number of values of , and .Keywords
Error-correcting codes; Binary codes; Error correction codes; Reed-Solomon codes;
fLanguage
English
Journal_Title
Information Theory, IEEE Transactions on
Publisher
ieee
ISSN
0018-9448
Type
jour
DOI
10.1109/TIT.1964.1053661
Filename
1053661
Link To Document