A table of upper bounds for binary codes

Agrell, Erik, 1965 (author)

Vardy, Alexander (author)

Zeger, Kenneth (author)

Institute of Electrical and Electronics Engineers (IEEE), 2001
2001
English.
In: IEEE Transactions on Information Theory. - : Institute of Electrical and Electronics Engineers (IEEE). - 0018-9448 .- 1557-9654. ; 47:7, s. 3004-3006

Related links:: http://publications.... (primary) (free); show more...; http://publications....; https://research.cha...; https://doi.org/10.1...; show less...

Abstract Subject headings

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.

By the author/editor: Agrell, Erik, 19 ...; Vardy, Alexander; Zeger, Kenneth

About the subject

Kungliga biblioteket hanterar dina personuppgifter i enlighet med EU:s dataskyddsförordning (2018), GDPR. Läs mer om hur det funkar här.
Så här hanterar KB dina uppgifter vid användning av denna tjänst.