• DocumentCode
    942136
  • Title

    Subcodes and covering radius (Corresp.)

  • Author

    Adams, Michael J.

  • Volume
    32
  • Issue
    5
  • fYear
    1986
  • fDate
    9/1/1986 12:00:00 AM
  • Firstpage
    700
  • Lastpage
    701
  • Abstract
    A sharp lower bound on the covering radius of a linear, binary code is given in terms of the covering radius of any subcode of index two. An upper bound on the norm of a code is then derived. These results hold for all linear codes over GF (2) .
  • Keywords
    Linear coding; Binary codes; Error correction codes; Hamming weight; Linear code; Notice of Violation; Upper bound;
  • fLanguage
    English
  • Journal_Title
    Information Theory, IEEE Transactions on
  • Publisher
    ieee
  • ISSN
    0018-9448
  • Type

    jour

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