Asymptotically good codes have infinite trellis complexity

DOI10.1109/18.370171MaRDI QIDQ4838693zbMATH OpenOpenAlexFDO

Authors Alec Lafourcade, Alexander Vardy

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

boundtrellis complexitydecodingasymptotically good codes

Mathematics Subject Classification ID

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

Recommendations

• Asymptotically good codes
• Asymptotically good convolutional codes
• Asymptotic Upper Bounds on the Minimum Distance of Trellis Codes
• Asymptotically good homological error correcting codes
• On infinitary finite length codes
• Robustly good trellis codes
• The trellis complexity of convolutional codes
• Asymptotically good codes from generalized algebraic-geometry codes
• Kolmogorov complexity and the asymptotic bound for error-correcting codes
• On the trellis complexity of certain binary linear block codes

Cited in

(3)

• Designing lexicographic codes with a given trellis complexity
• 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

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q4838693)