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

DOI10.1109/18.556701zbMath0867.94031OpenAlexW2015681515WikidataQ59768144 ScholiaQ59768144MaRDI QIDQ3129488

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)

Related Items (3)

On the optimality of pseudo-polynomial algorithms for integer programming ⋮ The “Art of Trellis Decoding” Is NP-Hard ⋮ 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