Asymptotically good codes have infinite trellis complexity

DOI10.1109/18.370171zbMath0827.94027OpenAlexW2010203871MaRDI QIDQ4838693

Alexander Vardy, Alec Lafourcade

Publication date: 17 December 1995

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

Full work available at URL: https://doi.org/10.1109/18.370171

zbMATH Keywords

decodingboundtrellis complexityasymptotically good codes

Mathematics Subject Classification ID

Linear codes (general theory) (94B05) Bounds on codes (94B65) Decoding (94B35)

Related Items (2)

Soft decoding of short/medium length codes using ordered statistics for quantum key distribution ⋮ On codes satisfying the double chain condition

This page was built for publication: Asymptotically good codes have infinite trellis complexity