Lower bounds on trellis complexity of block codes

DOI10.1109/18.476318MaRDI QIDQ4880315zbMATH OpenOpenAlexFDO

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

zbMATH Keywords

asymptotic behaviorblock codesdynamics of codesgeneralized Hamming weight hierarchylower boundmaximum-likelihood decodingnonlinear codesstate-complexity of linear codestrellis complexity

Mathematics Subject Classification ID

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

Recommendations

• Trellis decoding complexity of linear block codes
• Bounds on complexity of trellis decoding of linear block codes
• Lower Bounds on the State Complexity of Linear Tail-Biting Trellises
• On complexity of trellis structure of linear block codes

Cited in

(17)

• Bounding the trellis state complexity of algebraic geometric codes
• Bounds on complexity of trellis decoding of linear block codes
• Block transitive codes attaining the Tsfasman-Vladut-Zink bound
• On the relative profiles of a linear code and a subcode
• On the complexity of suboptimal decoding for list and decision feedback schemes
• Minimum distance bounding techniques for individual trellis codes
• Trellis decoding complexity of linear block codes
• Low State Complexity Block Codes Via Convolutional Codes
• Lower Bounds on the State Complexity of Linear Tail-Biting Trellises
• Trellis Complexity of Short Linear Codes
• Minimal trellises for block codes
• Bounds on the trellis size of linear block codes
• Trellis complexity of linear block codes via atomic codewords
• Entropy/length profiles, bounds on the minimal covering of bipartite graphs, and trellis complexity of nonlinear codes
• The weighted coordinates bound and trellis complexity of block codes and periodic packings
• On the trellis complexity of certain binary linear block codes
• Dimension/length profiles and trellis complexity of 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)