Search: onr:"swepub:oai:research.chalmers.se:a2f4f298-803c-4b58-9c9f-08c3b3a91d50" >
A table of upper bo...
-
Agrell, Erik,1965
(author)
A table of upper bounds for binary codes
- Article/chapterEnglish2001
Publisher, publication year, extent ...
-
Institute of Electrical and Electronics Engineers (IEEE),2001
-
electronicrdacarrier
Numbers
-
LIBRIS-ID:oai:research.chalmers.se:a2f4f298-803c-4b58-9c9f-08c3b3a91d50
-
https://research.chalmers.se/publication/14987URI
-
https://doi.org/10.1109/18.959279DOI
Supplementary language notes
-
Language:English
-
Summary in:English
Part of subdatabase
Classification
-
Subject category:art swepub-publicationtype
-
Subject category:ref swepub-contenttype
Notes
-
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.
Subject headings and genre
Added entries (persons, corporate bodies, meetings, titles ...)
-
Vardy, Alexander
(author)
-
Zeger, Kenneth
(author)
Related titles
-
In:IEEE Transactions on Information Theory: Institute of Electrical and Electronics Engineers (IEEE)47:7, s. 3004-30060018-94481557-9654
Internet link
Find in a library
To the university's database