• DocumentCode
    1027215
  • Title

    Improved sphere bounds on the covering radius of codes

  • Author

    Van Wee, Gerhard J M

  • Author_Institution
    Dept. of Math. & Comput. Sci., Eindhoven Univ. of Technol., Netherlands
  • Volume
    34
  • Issue
    2
  • fYear
    1988
  • fDate
    3/1/1988 12:00:00 AM
  • Firstpage
    237
  • Lastpage
    245
  • Abstract
    The sphere bound is a trivial lower bound on K(n,R), the minimal cardinality of any binary code of length n and with covering radius R. By simple arguments it is considerably improved, to K(n,1)⩾2 n/n for n even. A table of lower and upper bounds on K(n,R) for n⩽33, R ⩽10 is included
  • Keywords
    error correction codes; binary code; covering radius; minimal cardinality; sphere bound; trivial lower bound; upper bounds; Binary codes; Linear code; Mathematics; Upper bound;
  • fLanguage
    English
  • Journal_Title
    Information Theory, IEEE Transactions on
  • Publisher
    ieee
  • ISSN
    0018-9448
  • Type

    jour

  • DOI
    10.1109/18.2632
  • Filename
    2632
    • Link To Document
    https://search.isc.ac/dl/search/defaultta.aspx?DTC=49&DC=1027215