DocumentCode
1205873
Title
An improvement of the Van Wee bound for binary linear covering codes
Author
Struik, Rene
Author_Institution
Dept. of Math. & Comput. Sci., Eindhoven Univ. of Technol., Netherlands
Volume
40
Issue
4
fYear
1994
fDate
7/1/1994 12:00:00 AM
Firstpage
1280
Lastpage
1284
Abstract
The Van Wee bound gives a lower bound on the cardinality of (block) codes with a prescribed covering radius. The author presents an improvement of this bound for binary linear codes and compares the results with other bounds mentioned in the literature. Almost all reported bounds can be obtained via the present bound as well; moreover, the present authors obtain a number of new lower bounds
Keywords
binary sequences; block codes; Van Wee bound; binary linear covering codes; block codes; cardinality; covering radius; Block codes; Error correction codes; Hamming distance; Linear code; Mathematics;
fLanguage
English
Journal_Title
Information Theory, IEEE Transactions on
Publisher
ieee
ISSN
0018-9448
Type
jour
DOI
10.1109/18.335936
Filename
335936
Link To Document