• DocumentCode
    924899
  • Title

    Complete decoding of triple-error-correcting binary BCH codes

  • Author

    Van Der Horst, José Antonio ; Berger, Toby

  • Volume
    22
  • Issue
    2
  • fYear
    1976
  • fDate
    3/1/1976 12:00:00 AM
  • Firstpage
    138
  • Lastpage
    147
  • Abstract
    An extensive study of binary triple-error-correcting codes of primitive length n = 2^{m} - 1 is reported that results in a complete decoding algorithm whenever the maximum coset weight W_{\\max } is five. In this regard it is shown that W_{\\max } = 5 when four divides m , and strong support is provided for the validity of the conjecture that W_{\\max } = 5 for all m . The coset weight distribution is determined exactly in some cases and bounded in others.
  • Keywords
    BCH codes; Decoding; Decoding; Density estimation robust algorithm; Encoding; Equations; Frequency; Information theory; Null space; Polynomials; Source coding;
  • fLanguage
    English
  • Journal_Title
    Information Theory, IEEE Transactions on
  • Publisher
    ieee
  • ISSN
    0018-9448
  • Type

    jour

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