Quasi-cyclic structure of Reed-Muller codes and their smallest regular trellis diagram
- 1 May 1997
- journal article
- Published by Institute of Electrical and Electronics Engineers (IEEE) in IEEE Transactions on Information Theory
- Vol. 43 (3) , 1040-1052
- https://doi.org/10.1109/18.568718
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 presentedKeywords
This publication has 8 references indexed in Scilit:
- Trellis complexity of linear block codes via atomic codewordsPublished by Springer Nature ,1996
- On the trellis structure of block codesIEEE Transactions on Information Theory, 1995
- On complexity of trellis structure of linear block codesIEEE Transactions on Information Theory, 1993
- The dynamics of group codes: state spaces, trellis diagrams, and canonical encodersIEEE Transactions on Information Theory, 1993
- Coset codes. II. Binary lattices and related codesIEEE Transactions on Information Theory, 1988
- Minimal trellises for block codesIEEE Transactions on Information Theory, 1988
- Efficient maximum likelihood decoding of linear block codes using a trellisIEEE Transactions on Information Theory, 1978
- Optimal decoding of linear codes for minimizing symbol error rate (Corresp.)IEEE Transactions on Information Theory, 1974