DocumentCode
1304338
Title
An improved sphere covering bound for the codes with n =3 R +2
Author
Hou, Xiang-Dong
Author_Institution
Dept. of Math., Illinois Univ., Chicago, IL, USA
Volume
36
Issue
6
fYear
1990
fDate
11/1/1990 12:00:00 AM
Firstpage
1476
Lastpage
1478
Abstract
Let C be a binary code (not necessarily linear) with covering radius R and length n =3R +2. The sphere covering bound on the cardinality of C is improved considerably provided C has minimal distance d >2. Some new results on the function t [n ,k ] (the smallest covering radius of any binary linear code with length n and dimension k ): t [38.6]⩾13, t [47.7]⩾16, t [59.8]⩾20 are given
Keywords
error correction codes; binary code; cardinality; covering radius; minimal distance; sphere covering bound; Binary codes; Equations; Information theory; Linear code; Mathematics; Vectors;
fLanguage
English
Journal_Title
Information Theory, IEEE Transactions on
Publisher
ieee
ISSN
0018-9448
Type
jour
DOI
10.1109/18.59951
Filename
59951
Link To Document