Te "art of trellis decoding" is computationally hard-for large fields

DOI10.1109/18.669287MaRDI QIDQ4400342zbMATH OpenOpenAlexFDO

Authors

Publication date 2 August 1998

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

Full work available at URL https://doi.org/10.1109/18.669287

zbMATH Keywords

MDS codesNP-hardnesstrellis complexityVandermonde matrices

Mathematics Subject Classification ID

Algorithmic information theory (Kolmogorov complexity, etc.) (68Q30) Combined modulation schemes (including trellis codes) in coding theory (94B12) Decoding (94B35)

Recommendations

• The “Art of Trellis Decoding” Is NP-Hard
• On the intractability of permuting a block code to minimize trellis complexity
• Trellis decoding complexity of linear block codes
• scientific article; zbMATH DE number 1284437

Cited in

(3)

• On the intractability of permuting a block code to minimize trellis complexity
• A simpler self-reduction algorithm for matroid path-width
• The “Art of Trellis Decoding” Is NP-Hard

This page was built for publication: Te "art of trellis decoding" is computationally hard-for large fields

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