DocumentCode
1379572
Title
New lower bounds for covering codes
Author
Hou, Xiang-Dong
Author_Institution
Dept. of Math., Illinois Univ., Chicago, IL, USA
Volume
36
Issue
4
fYear
1990
fDate
7/1/1990 12:00:00 AM
Firstpage
895
Lastpage
899
Abstract
Some new lower bounds on |C| for a binary linear [n , k ]R code C with n +1=t (R +1)-r (0⩽r <R +1, t >2 odd) or with n +1=t (R +1)-1(t >2 even) are obtained. These bounds improve the sphere covering bound considerably and give several new values and lower bounds for the function t [n , k ], the smallest covering radius of any [n , k ] code
Keywords
codes; [n, k] code; binary linear code; covering codes; lower bounds; sphere covering bound; Binary codes; Concatenated codes; Encoding; Error correction codes; Gas insulated transmission lines; Linear code; Linearity; Network address translation; Notice of Violation; Welding;
fLanguage
English
Journal_Title
Information Theory, IEEE Transactions on
Publisher
ieee
ISSN
0018-9448
Type
jour
DOI
10.1109/18.53754
Filename
53754
Link To Document