DocumentCode
1543272
Title
A table of upper bounds for binary codes
Author
Agrell, Erik ; Vardy, Alexander ; Zeger, Kenneth
Author_Institution
Dept. of Signals & Syst., Chalmers Univ. of Technol., Goteborg, Sweden
Volume
47
Issue
7
fYear
2001
fDate
11/1/2001 12:00:00 AM
Firstpage
3004
Lastpage
3006
Abstract
Let A(n, d) denote the maximum possible number of codewords in an (n, d) binary code. We establish four new bounds on A(n, d), namely, A(21, 4)⩽43689, A(22, 4)⩽87378, A(22, 6)⩽6941, and A(23, 4)⩽173491. Furthermore, using previous upper bounds on the size of constant-weight binary codes, we reapply known methods to generate a table of bounds on A(n, d) for all n⩽28. This table extends the range of parameters compared with previously known tables
Keywords
binary codes; binary code; codewords; constant-weight binary codes; upper bounds; Binary codes; Hamming distance; Linear programming; Upper bound; Vectors;
fLanguage
English
Journal_Title
Information Theory, IEEE Transactions on
Publisher
ieee
ISSN
0018-9448
Type
jour
DOI
10.1109/18.959279
Filename
959279
Link To Document