On the intractability of permuting a block code to minimize trellis complexity

DOI10.1109/18.556701MaRDI QIDQ3129488zbMATH OpenOpenAlexWikidataFDO

Authors Gavin B. Horn, Frank R. Kschischang

Publication date 27 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.556701

zbMATH Keywords

block-code trellisespermutation trellis complexity

Mathematics Subject Classification ID

Linear codes (general theory) (94B05)

Recommendations

• Te "art of trellis decoding" is computationally hard-for large fields
• The “Art of Trellis Decoding” Is NP-Hard
• On the trellis structure of block codes
• On complexity of trellis structure of linear block codes

Cited in

(5)

• On the optimality of pseudo-polynomial algorithms for integer programming
• On the optimum bit orders with respect to the state complexity of trellis diagrams for binary linear codes
• Te "art of trellis decoding" is computationally hard-for large fields
• On the optimality of pseudo-polynomial algorithms for integer programming
• The “Art of Trellis Decoding” Is NP-Hard

This page was built for publication: On the intractability of permuting a block code to minimize trellis complexity

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