• DocumentCode
    1051465
  • Title

    A New Bound for the Minimum Distance of a Cyclic Code From Its Defining Set

  • Author

    Betti, Emanuele ; Sala, Massimiliano

  • Author_Institution
    Dipt. di Matematica, Pisa Univ.
  • Volume
    52
  • Issue
    8
  • fYear
    2006
  • Firstpage
    3700
  • Lastpage
    3706
  • Abstract
    A new lower bound for the distance of cyclic codes is proposed. This bound depends on the defining set of the code, like several other bounds. The proposed bound improves upon the Bose-Chaudhuri-Hocquehghen (BCH) bound and, for some codes, improves upon the Hartmann-Tzeng bound and the Roos bound as well
  • Keywords
    BCH codes; cyclic codes; BCH bound; Hartmann-Tzeng bound; Roos bound; cyclic code; defining set; minimum distance; Data mining; Decoding; Error analysis; Error correction codes; Information processing; Reed-Solomon codes; Bose–Chaudhuri–Hocquehghen (BCH) bound; Hamming distance; Hartmann–Tzeng bound; Roos bound; cyclic codes;
  • fLanguage
    English
  • Journal_Title
    Information Theory, IEEE Transactions on
  • Publisher
    ieee
  • ISSN
    0018-9448
  • Type

    jour

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