• DocumentCode
    1935758
  • Title

    On a class of cyclic codes whose minimum distance exceeds the BCH bound

  • Author

    Lomakov, Valeriy

  • Author_Institution
    St.-Petersburg State Univ. of Aerosp. Instrum., St. Petersburg, Russia
  • fYear
    2012
  • fDate
    5-10 Sept. 2012
  • Firstpage
    41
  • Lastpage
    43
  • Abstract
    It is shown that for any prime p and any integer ℓ ≥ 1, there is a cyclic code of length p2(ℓ+1) - 1 and dimension pℓ+1(pℓ+1 - 2) over the finite field GF(p) whose minimum distance ≥ p + 2ℓ is greater than or equal to the BCH bound p + 2.
  • Keywords
    BCH codes; cyclic codes; BCH bound; cyclic code; finite field GF; Aerospace electronics; Control systems; Educational institutions; Electronic mail; Equations; Information theory; Redundancy;
  • fLanguage
    English
  • Publisher
    ieee
  • Conference_Titel
    Problems of Redundancy in Information and Control Systems (RED), 2012 XIII International Symposium on
  • Conference_Location
    St. Petersburg
  • Print_ISBN
    978-1-4673-0168-8
  • Type

    conf

  • DOI
    10.1109/RED.2012.6338404
  • Filename
    6338404
    • Link To Document
    https://search.isc.ac/dl/search/defaultta.aspx?DTC=49&DC=1935758