• DocumentCode
    936484
  • Title

    A new lower bound for the minimum distance of a cyclic code

  • Author

    Roos, Cornelis

  • Volume
    29
  • Issue
    3
  • fYear
    1983
  • fDate
    5/1/1983 12:00:00 AM
  • Firstpage
    330
  • Lastpage
    332
  • Abstract
    A new lower bound for the minimum distance of a linear code is derived. When applied to cyclic codes both the Bose-Chaudhuri-Hocquenghem (BCH) bound and the Hartmann-Tzeng (HT) bound are obtained as corollaries. Examples for which the new bound is superior to these two bounds, as well as to the Carlitz-Uchiyama bound, are given.
  • Keywords
    Cyclic coding; Galois fields; Information theory; Linear code; Mathematics; Parity check codes; Retirement;
  • fLanguage
    English
  • Journal_Title
    Information Theory, IEEE Transactions on
  • Publisher
    ieee
  • ISSN
    0018-9448
  • Type

    jour

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