The weighted coordinates bound and trellis complexity of block codes and periodic packings

DOI10.1109/18.771239zbMATH Open0959.94035OpenAlexW2115497242MaRDI QIDQ4701429FDOQ4701429

Authors: Ilan Reuven, Yair Be'ery 

Publication date: 21 November 1999

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

Full work available at URL: https://semanticscholar.org/paper/aebaa247e6699ef87925821b70f895cb0bbdadf9

Recommendations

• Lower bounds on trellis complexity of block codes
• Trellis decoding complexity of linear block codes
• Dimension/length profiles and trellis complexity of linear block codes
• Entropy/length profiles, bounds on the minimal covering of bipartite graphs, and trellis complexity of nonlinear codes

zbMATH Keywords

latticetrellis complexityblock codesperiodic packingsentropy/length profiledimension/length profilestate complexity profileweighted coordinates boundweighted entropy profiles

Mathematics Subject Classification ID

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

Cited In (1)

• The packing radius of a poset block code

This page was built for publication: The weighted coordinates bound and trellis complexity of block codes and periodic packings

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