Monotonicity-Based Fast Algorithms for MAP Estimation of Markov Sequences Over Noisy Channels

DOI10.1109/TIT.2004.830782MaRDI QIDQ3547760zbMATH OpenOpenAlexFDO

Authors Xiaolin Wu, Sorina Dumitrescu, Zhe Wang

Publication date 21 December 2008

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

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

Mathematics Subject Classification ID

Applications of Markov chains and discrete-time Markov processes on general state spaces (social mobility, learning theory, industrial processes, etc.) (60J20) Signal theory (characterization, reconstruction, filtering, etc.) (94A12) Markov chains (discrete-time Markov processes on discrete state spaces) (60J10) Channel models (including quantum) in information and communication theory (94A40)

Recommendations

• MAP decoding in channels with memory
• MAP symbol decoding in channels with error bursts
• Optimal detection of discrete Markov sources over discrete memoryless channels-applications to combined source-channel coding
• Properties of estimation algorithms for binary sequences
• The Viterbi algorithm and Markov noise memory

Cited in

(4)

• MAP decoding in channels with memory
• Alternative structure for computing APPs of the markov source
• MAP symbol decoding in channels with error bursts
• Properties of estimation algorithms for binary sequences

This page was built for publication: Monotonicity-Based Fast Algorithms for MAP Estimation of Markov Sequences Over Noisy Channels

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