The trellis complexity of convolutional codes

DOI10.1109/18.556680zbMATH Open0878.94055OpenAlexW2101114090MaRDI QIDQ3129472FDOQ3129472

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

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
• Differential trellis decoding of convolutional codes
• On bit-level trellis complexity of Reed-Muller codes
• Trellis complexity versus the coding gain of lattices. II

zbMATH Keywords

convolutional codestrellis complexitydecoding complexityminimal trellistrellis representation

Mathematics Subject Classification ID

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

Cited In (17)

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

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)