On trellis structures for Reed-Muller codes

DOI10.1006/ffta.1999.0265zbMath0953.94025OpenAlexW1987484145WikidataQ126339837 ScholiaQ126339837MaRDI QIDQ1971064

Tim Blackmore, Graham H. Norton

Publication date: 22 January 2001

Published in: Finite Fields and their Applications (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1006/ffta.1999.0265

zbMATH Keywords

Reed-Muller codestrellises for codes

Mathematics Subject Classification ID

Linear codes (general theory) (94B05) Decoding (94B35)

Cites Work

• Unnamed Item
• Unnamed Item
• Trellis decoding complexity of linear block codes
• Minimal trellises for block codes
• Coset codes. II. Binary lattices and related codes
• Bounds on the trellis size of linear block codes
• On the optimum bit orders with respect to the state complexity of trellis diagrams for binary linear codes
• Efficient maximum likelihood decoding of linear block codes using a trellis
• On complexity of trellis structure of linear block codes
• Dimension/length profiles and trellis complexity of linear block codes
• On the trellis structure of block codes
• On bit-level trellis complexity of Reed-Muller codes
• On the BCJR trellis for linear block codes

This page was built for publication: On trellis structures for Reed-Muller codes