• DocumentCode
    915921
  • Title

    On upper bounds for unrestricted binary-error-correcting codes

  • Author

    Johnson, Selmer M.

  • Volume
    17
  • Issue
    4
  • fYear
    1971
  • fDate
    7/1/1971 12:00:00 AM
  • Firstpage
    466
  • Lastpage
    478
  • Abstract
    In this paper improved upper bounds are obtained for A(n,d) , the maximum number of binary code vectors in a code of block length n and minimum distance d . Known bounds are presented in a unified way and then refined, giving improvement over best previously published results in almost all cases. Finally, tabulations of the improved results are given. Asymptotically, the new bounds agree with those given by Elias.
  • Keywords
    Error-correcting codes; Binary codes; Error correction codes; Hamming distance; Helium; III-V semiconductor materials; Upper bound;
  • fLanguage
    English
  • Journal_Title
    Information Theory, IEEE Transactions on
  • Publisher
    ieee
  • ISSN
    0018-9448
  • Type

    jour

  • DOI
    10.1109/TIT.1971.1054656
  • Filename
    1054656
    • Link To Document
    https://search.isc.ac/dl/search/defaultta.aspx?DTC=49&DC=915921