Optimal detection of discrete Markov sources over discrete memoryless channels-applications to combined source-channel coding

DOI10.1109/18.272478zbMATH Open0803.94011OpenAlexW2123327578MaRDI QIDQ4307288FDOQ4307288

Authors: Nam C. Phamdo, Nariman Farvardin 

Publication date: 4 October 1994

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

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

Recommendations

• Detection of binary Markov sources over channels with additive Markov noise
• The Viterbi algorithm and Markov noise memory
• Quantization of memoryless and Gauss-Markov sources over binary Markov channels
• Efficient Source Decoding Over Memoryless Noisy Channels Using Higher Order Markov Models

zbMATH Keywords

discrete memoryless channelcombined source-channel codingdiscrete Markov sourcemaximum a posteriori detection

Mathematics Subject Classification ID

Detection theory in information and communication theory (94A13) Source coding (94A29) Channel models (including quantum) in information and communication theory (94A40)

Cited In (7)

• Optimal subblock-by-subblock detection
• Error exponents for distributed detection of Markov sources
• On asymptotically optimal methods of prediction and adaptive coding for Markov sources
• The Viterbi algorithm and Markov noise memory
• Efficient Source Decoding Over Memoryless Noisy Channels Using Higher Order Markov Models
• Monotonicity-Based Fast Algorithms for MAP Estimation of Markov Sequences Over Noisy Channels
• Title not available (Why is that?)

This page was built for publication: Optimal detection of discrete Markov sources over discrete memoryless channels-applications to combined source-channel coding

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