Optimal Sequence Detection and Optimal Symbol-by-Symbol Detection: Similar Algorithms
From MaRDI portal
Publication:3944478
DOI10.1109/TCOM.1982.1095391zbMath0484.94007OpenAlexW2098958777MaRDI QIDQ3944478
Thomas M. Cover, Jeremiah F. Hayes
Publication date: 1982
Published in: IEEE Transactions on Communications (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1109/tcom.1982.1095391
Decoding (94B35) Communication theory (94A05) Modulation and demodulation in information and communication theory (94A14)
Related Items (4)
Memory-reduced maximum a posteriori probability decoding for high-throughput parallel turbo decoders ⋮ On the accuracy of the MAP inference in HMMs ⋮ Dynamic programming in digital communications: Viterbi decoding to turbo multiuser detection ⋮ Asymptotic risks of Viterbi segmentation
This page was built for publication: Optimal Sequence Detection and Optimal Symbol-by-Symbol Detection: Similar Algorithms