On the trellis complexity of block and convolutional codes

MaRDI QIDQ1389282zbMATH OpenFDO

Authors U. Dettmar, R. Raschhofer, Ulrich Sorger

Publication date 16 July 1998

Published in Problems of Information Transmission (Search for Journal in Brave)

zbMATH Keywords

complexitymaximum likelihood decodingblock codesdecoding complexity of PUM codespunctured convolutional codessyndrome trellistrellis Viterbi-type decoding algorithmsupper bound on the minimal trellis complexity

Mathematics Subject Classification ID

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

Recommendations

• The trellis complexity of convolutional codes
• Decoding of convolutional codes using a syndrome trellis
• Bounds on complexity of trellis decoding of linear block codes

Cited in

(14)

• Variable-complexity trellis decoding of binary convolutional codes
• scientific article; zbMATH DE number 3880586 (Why is no real title available?)
• Error-trellises for convolutional codes. II: Decoding methods
• A comparison of trellis modules for binary convolutional codes
• Trellis complexity versus the coding gain of lattices. II
• Complexity and sliding-block decodability
• On Low-Complexity Maximum-Likelihood Decoding of Convolutional Codes
• Decoding of convolutional codes using a syndrome trellis
• On the trellis representation of the Delsarte-Goethals codes
• The trellis complexity of convolutional codes
• Links between complexity theory and constrained block coding
• Bounds on the trellis size of linear block 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: On the trellis complexity of block and convolutional codes

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