Trellis-oriented decomposition and trellis complexity of composite-length cyclic codes

DOI10.1109/18.391268MaRDI QIDQ4857528zbMATH OpenOpenAlexFDO

Authors Yuval Berger, Yair Be'ery

Publication date 4 February 1996

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

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

zbMATH Keywords

composite-length cyclic codesconcatenated codesconstacyclic codescyclic codesgeneralized Hamming weightsproduct codessoft-decision decoderstrellis complexityupper bounds

Mathematics Subject Classification ID

Cyclic codes (94B15) Decoding (94B35) Bounds on codes (94B65)

Recommendations

• On complexity of trellis structure of linear block codes
• Trellis decoding complexity of linear block codes
• The trellis complexity of convolutional codes
• Bounds on complexity of trellis decoding of linear block codes
• Trellis complexity of linear block codes via atomic codewords

This page was built for publication: Trellis-oriented decomposition and trellis complexity of composite-length cyclic codes

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