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

DOI10.1109/18.669287zbMath0906.94024OpenAlexW2116406514MaRDI QIDQ4400342

No author found.

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)

Related Items (2)

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