On the BCJR trellis for linear block codes

DOI10.1109/18.508834MaRDI QIDQ4885710zbMATH OpenOpenAlexFDO

Authors Robert J. McEliece

Publication date 28 July 1996

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

Full work available at URL https://resolver.caltech.edu/CaltechAUTHORS:MCEieeetit96a

zbMATH Keywords

block codestrellisViterbi algorithm

Mathematics Subject Classification ID

Combined modulation schemes (including trellis codes) in coding theory (94B12) Decoding (94B35)

Recommendations

• On the trellis complexity of certain binary linear block codes
• scientific article; zbMATH DE number 1181550
• On the trellis structure of block codes
• On complexity of trellis structure of linear block codes
• The BCJR trellis and trellis decoders for some BCH codes
• scientific article; zbMATH DE number 1135091
• Bounds on the trellis size of linear block codes
• Bounds on complexity of trellis decoding of linear block codes
• Trellis decoding complexity of linear block codes
• scientific article; zbMATH DE number 1106311

Cited in

(11)

• Computation of distributions and their moments in the trellis
• Generalized punctured convolutional codes with unequal error protection
• The BCJR trellis and trellis decoders for some BCH codes
• The Euler characteristic of the minimal code trellis is maximum
• On viewing block codes as finite automata.
• On the comparative complexity of algorithms for constructing the syndrome trellis of a linear block code
• On maximum length convolutional codes under a trellis complexity constraint
• On Viterbi-like algorithms and their application to Reed-Muller codes
• On trellis structures for Reed-Muller codes
• Matrix theory for minimal trellises
• Minimal trellises for non-degenerate and degenerate decoding of quantum stabilizer codes

This page was built for publication: On the BCJR trellis for linear block codes

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