Lower bounds on trellis complexity of block codes

DOI10.1109/18.476318zbMath0858.94029OpenAlexW2158927130MaRDI QIDQ4880315

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

zbMATH Keywords

asymptotic behaviorlower boundnonlinear codesblock codestrellis complexitymaximum-likelihood decodinggeneralized Hamming weight hierarchydynamics of codesstate-complexity of linear codes

Mathematics Subject Classification ID

Bounds on codes (94B65) Combined modulation schemes (including trellis codes) in coding theory (94B12)

Related Items (2)

On the relative profiles of a linear code and a subcode ⋮ On the complexity of suboptimal decoding for list and decision feedback schemes

This page was built for publication: Lower bounds on trellis complexity of block codes