Bounds on the trellis size of linear block codes

DOI10.1109/18.179359MaRDI QIDQ4034451zbMATH OpenOpenAlexFDO

Authors Yuval Berger, Yair Be'ery

Publication date 16 May 1993

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

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

zbMATH Keywords

Reed-Muller codesrepeated-root cyclic codessoft-decision decodingcontraction indexmaximum-likelihood decodingminimal trellis representation of linear block codeszero-concurring codewords

Mathematics Subject Classification ID

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

Recommendations

• Bounds on complexity of trellis decoding of linear block codes
• On the trellis complexity of certain binary linear block codes
• Lower bounds on trellis complexity of block codes
• On complexity of trellis structure of linear block codes
• scientific article; zbMATH DE number 1284417
• Dimension/length profiles and trellis complexity of linear block codes
• Trellis decoding complexity of linear block codes
• scientific article; zbMATH DE number 4123671
• On the trellis structure of block codes
• On the trellis complexity of block and convolutional codes

Cited in

(7)

• On the BCJR trellis for linear block codes
• On trellis structures for Reed-Muller codes
• Block transitive codes attaining the Tsfasman-Vladut-Zink bound
• Linear tail-biting trellises, the square-root bound, and applications for Reed-Muller codes
• Some Bounds on the Size of Codes
• scientific article; zbMATH DE number 4123671 (Why is no real title available?)
• Trellis complexity of linear block codes via atomic codewords

This page was built for publication: Bounds on the trellis size of linear block codes

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