• DocumentCode
    917170
  • Title

    A bound for cyclic codes of composite length (Corresp.)

  • Author

    Hartmann, C. P R ; Tzeng, K.K.

  • Volume
    18
  • Issue
    2
  • fYear
    1972
  • fDate
    3/1/1972 12:00:00 AM
  • Firstpage
    307
  • Lastpage
    307
  • Abstract
    An upper bound on the minimum distance of cyclic codes of composite length is presented. This upper bound proves the BCH bound to be exact for many cyclic codes.
  • Keywords
    Cyclic codes; Information science; Polynomials; Upper bound;
  • fLanguage
    English
  • Journal_Title
    Information Theory, IEEE Transactions on
  • Publisher
    ieee
  • ISSN
    0018-9448
  • Type

    jour

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