• DocumentCode
    1253389
  • Title

    On the Newton and covering radii of linear codes

  • Author

    Gahidulin, E. ; Kløve, Torleiv

  • Author_Institution
    Moscow Inst. of Phys. & Technol., Russia
  • Volume
    45
  • Issue
    7
  • fYear
    1999
  • fDate
    11/1/1999 12:00:00 AM
  • Firstpage
    2534
  • Lastpage
    2536
  • Abstract
    The Newton radius of a code is the largest weight of a uniquely correctable error. The covering radius is the largest distance between a vector and the code. Two relations between the Newton radius and the covering radius are given
  • Keywords
    binary codes; error correction codes; linear codes; Newton radius; binary linear codes; covering radius; largest distance; largest weight; uniquely correctable error; vector; Computer science; Cryptography; Error correction; Error correction codes; Feedback; Linear code; Upper bound; Vectors;
  • fLanguage
    English
  • Journal_Title
    Information Theory, IEEE Transactions on
  • Publisher
    ieee
  • ISSN
    0018-9448
  • Type

    jour

  • DOI
    10.1109/18.796399
  • Filename
    796399