The trellis complexity of convolutional codes

DOI10.1109/18.556680zbMath0878.94055OpenAlexW2101114090MaRDI QIDQ3129472

No author found.

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) Decoding (94B35) Convolutional codes (94B10)

Related Items (2)

Generalized punctured convolutional codes with unequal error protection ⋮ On maximum length convolutional codes under a trellis complexity constraint

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