The trellis complexity of convolutional codes

DOI10.1109/18.556680MaRDI QIDQ3129472zbMATH OpenOpenAlexFDO

Authors

Publication date 27 April 1997

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

Full work available at URL https://resolver.caltech.edu/CaltechAUTHORS:20120223-102920927

zbMATH Keywords

convolutional codestrellis complexitydecoding complexityminimal trellistrellis representation

Mathematics Subject Classification ID

Analysis of algorithms and problem complexity (68Q25) Convolutional codes (94B10) Decoding (94B35)

Recommendations

• On the trellis complexity of block and convolutional codes
• Convolutional codes and complexity
• On maximum length convolutional codes under a trellis complexity constraint
• Variable-complexity trellis decoding of binary convolutional codes
• On the trellis complexity of certain binary linear block codes
• On complexity of trellis structure of linear block codes
• scientific article; zbMATH DE number 3865152
• Differential trellis decoding of convolutional codes
• On bit-level trellis complexity of Reed-Muller codes
• Trellis complexity versus the coding gain of lattices. II

Cited in

(17)

• Variable-complexity trellis decoding of binary convolutional codes
• Asymptotically good codes have infinite trellis complexity
• On maximum length convolutional codes under a trellis complexity constraint
• A comparison of trellis modules for binary convolutional codes
• Error-trellises for convolutional codes. I: Construction
• On the comparative complexity of algorithms for constructing the syndrome trellis of a linear block code
• Trellis complexity versus the coding gain of lattices. II
• Decoding of convolutional codes using a syndrome trellis
• scientific article; zbMATH DE number 1189021 (Why is no real title available?)
• Constructions of generalized concatenated codes and their trellis-based decoding complexity
• On the trellis representation of the Delsarte-Goethals codes
• Designing lexicographic codes with a given trellis complexity
• A goppa-like bound on the trellis state complexity of algebraic-geometric codes
• Generalized punctured convolutional codes with unequal error protection
• scientific article; zbMATH DE number 820487 (Why is no real title available?)
• Trellis-oriented decomposition and trellis complexity of composite-length cyclic codes
• Minimal Trellis Modules and Equivalent Convolutional Codes

This page was built for publication: The trellis complexity of convolutional codes

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