On bit-level trellis complexity of Reed-Muller codes

DOI10.1109/18.476337MaRDI QIDQ4880338zbMATH OpenOpenAlexFDO

Authors Chung-Chin Lu, Sy-Hann Huang

Publication date 15 September 1996

Published in IEEE Transactions on Information Theory (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1109/18.476337

zbMATH Keywords

Reed-Muller codetrellistrellis complexity

Mathematics Subject Classification ID

Combined modulation schemes (including trellis codes) in coding theory (94B12) Cyclic codes (94B15)

Recommendations

• On trellis structures for Reed-Muller codes
• scientific article; zbMATH DE number 1498785
• Trellis complexity of linear block codes via atomic codewords
• Linear tail-biting trellises, the square-root bound, and applications for Reed-Muller codes

Cited in

(11)

• The minimal generator matrix of a vector space
• On trellis structures for Reed-Muller codes
• Very low rate trellis/Reed-Muller (TRM) codes
• Trellis complexity versus the coding gain of lattices. II
• The trellis complexity of convolutional codes
• scientific article; zbMATH DE number 6534450 (Why is no real title available?)
• On the optimum bit orders with respect to the state complexity of trellis diagrams for binary linear codes
• scientific article; zbMATH DE number 1222363 (Why is no real title available?)
• Binary multilevel coset codes based on Reed-Muller codes
• Quasi-cyclic structure of Reed-Muller codes and their smallest regular trellis diagram
• scientific article; zbMATH DE number 1498785 (Why is no real title available?)

This page was built for publication: On bit-level trellis complexity of Reed-Muller codes

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q4880338)