• DocumentCode
    1424959
  • Title

    Quasi-cyclic structure of Reed-Muller codes and their smallest regular trellis diagram

  • Author

    Esmaeili, Morteza ; Gulliver, T. Aaron ; Secord, Norman P.

  • Author_Institution
    Dept. of Math. & Stat., Carleton Univ., Ottawa, Ont., Canada
  • Volume
    43
  • Issue
    3
  • fYear
    1997
  • fDate
    5/1/1997 12:00:00 AM
  • Firstpage
    1040
  • Lastpage
    1052
  • Abstract
    The largest quasi-cyclic subcode of the Reed-Muller code R(r,m), invariant under the shift T2m-l is determined. This code, denoted QCR(r,m,l), is presented through its module decomposition into cyclic submodules. The smallest regular trellis diagram (SRTD) is defined for block codes. This trellis and its construction algorithm are given for the class of cyclic-form codes. Using the cyclic-form structure of QCR(r,m,l), the 2l-section SRTD of this code is determined. The eight-section SRTD is given for the Reed-Muller codes R(r,m). The quasi-cyclic subcodes of R(r,m) with regular 2l-section minimal trellis diagrams are presented
  • Keywords
    Reed-Muller codes; block codes; cyclic codes; Reed-Muller codes; block codes; cyclic submodules; cyclic-form codes; cyclic-form structure; largest quasicyclic subcode; minimal trellis diagrams; module decomposition; quasicyclic structure; smallest regular trellis diagram; trellis construction algorithm; Acceleration; Block codes; Councils; Decoding; Mathematics; Statistics; Systems engineering and theory; Telecommunication computing; Very large scale integration; Viterbi algorithm;
  • fLanguage
    English
  • Journal_Title
    Information Theory, IEEE Transactions on
  • Publisher
    ieee
  • ISSN
    0018-9448
  • Type

    jour

  • DOI
    10.1109/18.568718
  • Filename
    568718