DocumentCode :
922662
Title :
Maximal 
-nary linear codes with large minimum distance (Corresp.)
-nary linear codes with large minimum distance (Corresp.)Author :
Patel, Arvind M.
Volume :
21
Issue :
1
fYear :
1975
fDate :
1/1/1975 12:00:00 AM
Firstpage :
106
Lastpage :
110
Abstract :
This correspondence presents a complete solution to the problem of constructing maximal -nary codes, for any word length 
and minimum distance 
in the region 
. Several interesting results regarding the interdependence of these codes are developed, which reveal the unique structure of the code spaces of the region . Some new maximal codes are obtained for the region 
.
-nary codes, for any word length and minimum distance in the region . Several interesting results regarding the interdependence of these codes are developed, which reveal the unique structure of the code spaces of the region . Some new maximal codes are obtained for the region .Keywords :
Linear codes; Computational complexity; Constraint theory; Linear code; Probability distribution;
fLanguage :
English
Journal_Title :
Information Theory, IEEE Transactions on
Publisher :
ieee
ISSN :
0018-9448
Type :
jour
DOI :
10.1109/TIT.1975.1055315
Filename :
1055315
Link To Document :
