• DocumentCode
    1538061
  • Title

    Decoding of cyclic codes over F2+uF2

  • Author

    Udaya, Paramapalli ; Bonnecaze, Alexis

  • Author_Institution
    Dept. of Math., R. Melbourne Inst. of Technol., Vic., Australia
  • Volume
    45
  • Issue
    6
  • fYear
    1999
  • fDate
    9/1/1999 12:00:00 AM
  • Firstpage
    2148
  • Lastpage
    2157
  • Abstract
    We give a simple decoding algorithm to decode linear cyclic codes of odd length over the ring R=F2+uF2={0,1,u,u¯=u+1}, where u2=0. A spectral representation of the cyclic codes over R is given and a BCH-like bound is given for the Lee distance of the codes. The ring R shares many properties of Z4 and F4 and admits a linear “Gray map”
  • Keywords
    BCH codes; Galois fields; Gray codes; binary codes; cyclic codes; decoding; linear codes; BCH-like bound; Lee distance; decoding algorithm; linear Gray map; linear cyclic codes; odd length codes; spectral representation; Computer science; Decoding; Information theory; Linearity;
  • fLanguage
    English
  • Journal_Title
    Information Theory, IEEE Transactions on
  • Publisher
    ieee
  • ISSN
    0018-9448
  • Type

    jour

  • DOI
    10.1109/18.782165
  • Filename
    782165
    • Link To Document
    https://search.isc.ac/dl/search/defaultta.aspx?DTC=49&DC=1538061