SwePub
Sök i SwePub databas

  Extended search

Träfflista för sökning "id:"swepub:oai:research.chalmers.se:a2f4f298-803c-4b58-9c9f-08c3b3a91d50" "

Search: id:"swepub:oai:research.chalmers.se:a2f4f298-803c-4b58-9c9f-08c3b3a91d50"

  • Result 1-1 of 1
Sort/group result
   
EnumerationReferenceCoverFind
1.
  • Agrell, Erik, 1965, et al. (author)
  • A table of upper bounds for binary codes
  • 2001
  • In: IEEE Transactions on Information Theory. - : Institute of Electrical and Electronics Engineers (IEEE). - 0018-9448 .- 1557-9654. ; 47:7, s. 3004-3006
  • Journal article (peer-reviewed)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.
  •  
Skapa referenser, mejla, bekava och länka
  • Result 1-1 of 1
Type of publication
journal article (1)
Type of content
peer-reviewed (1)
Author/Editor
Agrell, Erik, 1965 (1)
Vardy, Alexander (1)
Zeger, Kenneth (1)
University
Chalmers University of Technology (1)
Language
English (1)
Research subject (UKÄ/SCB)
Natural sciences (1)
Year
2001 (1)

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.

 
pil uppåt Close

Copy and save the link in order to return to this view