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

DOI10.1109/18.556701zbMATH Open0867.94031OpenAlexW2015681515WikidataQ59768144 ScholiaQ59768144MaRDI QIDQ3129488FDOQ3129488

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

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

zbMATH Keywords

block-code trellisespermutation trellis complexity

Mathematics Subject Classification ID

Linear codes (general theory) (94B05)

Cited In (4)

• The “Art of Trellis Decoding” Is NP-Hard
• On the optimum bit orders with respect to the state complexity of trellis diagrams for binary linear codes
• On the optimality of pseudo-polynomial algorithms for integer programming
• On the optimality of pseudo-polynomial algorithms for integer programming

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)