DocumentCode :
940116
Title :
The covering radius of cyclic codes of length up to 31 (Corresp.)
Author :
Downie, Diane E. ; Sloane, N. J A
Volume :
31
Issue :
3
fYear :
1985
fDate :
5/1/1985 12:00:00 AM
Firstpage :
446
Lastpage :
447
Abstract :
The covering radius is given for all binary cyclic codes of length less than or equal to 
. Many of these codes are optimal in the sense of having the smallest possible covering radius of any linear code of that length and dimension.
. Many of these codes are optimal in the sense of having the smallest possible covering radius of any linear code of that length and dimension.Keywords :
Linear code; Parity check codes; Testing; Welding;
fLanguage :
English
Journal_Title :
Information Theory, IEEE Transactions on
Publisher :
ieee
ISSN :
0018-9448
Type :
jour
DOI :
10.1109/TIT.1985.1057033
Filename :
1057033
Link To Document :
