Lower bounds on trellis complexity of block codes
DOI10.1109/18.476318zbMATH Open0858.94029OpenAlexW2158927130MaRDI QIDQ4880315FDOQ4880315
Authors: Alec Lafourcade, Alexander Vardy 
Publication date: 2 April 1997
Published in: IEEE Transactions on Information Theory (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1109/18.476318
Recommendations
asymptotic behaviorlower boundnonlinear codestrellis complexityblock codesmaximum-likelihood decodinggeneralized Hamming weight hierarchydynamics of codesstate-complexity of linear codes
Bounds on codes (94B65) Combined modulation schemes (including trellis codes) in coding theory (94B12)
Cited In (13)
- Minimum distance bounding techniques for individual trellis codes
- Bounding the trellis state complexity of algebraic geometric codes
- Low State Complexity Block Codes Via Convolutional Codes
- Bounds on the trellis size of linear block codes
- Bounds on complexity of trellis decoding of linear block codes
- On the complexity of suboptimal decoding for list and decision feedback schemes
- Trellis Complexity of Short Linear Codes
- Lower Bounds on the State Complexity of Linear Tail-Biting Trellises
- Block transitive codes attaining the Tsfasman-Vladut-Zink bound
- Trellis complexity of linear block codes via atomic codewords
- On the relative profiles of a linear code and a subcode
- Minimal trellises for block codes
- On the trellis complexity of certain binary linear block codes
This page was built for publication: Lower bounds on trellis complexity of block codes
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q4880315)
