Two-Dimensional Maximum-Likelihood Sequence Detection Is NP Hard

DOI10.1109/TIT.2011.2170108MaRDI QIDQ5272191zbMATH OpenOpenAlexFDO

Authors Erik Ordentlich, Ron M. Roth

Publication date 12 July 2017

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

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

Mathematics Subject Classification ID

Signal detection and filtering (aspects of stochastic processes) (60G35) Computational difficulty of problems (lower bounds, completeness, difficulty of approximation, etc.) (68Q17) Detection theory in information and communication theory (94A13) Modulation and demodulation in information and communication theory (94A14)

Cited in

(1)

• Breadth-first maximum likelihood sequence detection: Basics

This page was built for publication: Two-Dimensional Maximum-Likelihood Sequence Detection Is NP Hard

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