• DocumentCode
    2055113
  • Title

    Very easily decodable nonlinear cyclic codes

  • Author

    Massey, James L.

  • Author_Institution
    Dept. of Inform. Tech., Lund Univ., Sweden
  • fYear
    2002
  • fDate
    2002
  • Firstpage
    172
  • Abstract
    A class of nonlinear binary cyclic codes of length n=m2m, constant weight w=m2m-1, and minimum distance dmin=2m, with M=n codewords for every m≥2 is introduced. The decoding computation is shown to be equivalent to performing two correlations of fixed sequences with the received word.
  • Keywords
    binary codes; binary sequences; cyclic codes; decoding; nonlinear codes; binary codes; binary sequences; decoding; nonlinear cyclic codes; Binary codes; Binary sequences; Correlators; Counting circuits; Decoding; Error correction; Fires; Hamming weight; Interleaved codes;
  • fLanguage
    English
  • Publisher
    ieee
  • Conference_Titel
    Information Theory, 2002. Proceedings. 2002 IEEE International Symposium on
  • Print_ISBN
    0-7803-7501-7
  • Type

    conf

  • DOI
    10.1109/ISIT.2002.1023444
  • Filename
    1023444
    • Link To Document
    https://search.isc.ac/dl/search/defaultta.aspx?DTC=49&DC=2055113