Quantization of memoryless and Gauss-Markov sources over binary Markov channels

DOI10.1109/26.592605MaRDI QIDQ4355498zbMATH OpenOpenAlexFDO

Authors Nam C. Phamdo, Fady Alajaji, Nariman Farvardin

Publication date 11 November 1997

Published in IEEE Transactions on Communications (Search for Journal in Brave)

Full work available at URL http://hdl.handle.net/1903/5549

zbMATH Keywords

channels with memorydetectionMarkov noise

Mathematics Subject Classification ID

Communication theory (94A05) Channel models (including quantum) in information and communication theory (94A40)

Recommendations

• Noiseless coding of binary finite-order Markov sources (Corresp.)
• Optimal detection of discrete Markov sources over discrete memoryless channels-applications to combined source-channel coding
• Joint source-channel coding of discrete-time signals with continuous amplitudes.
• Detection of binary Markov sources over channels with additive Markov noise

Cited in

(6)

• Joint source-channel coding via model predictive control
• Optimal sequential vector quantization of Markov sources
• Efficient Source Decoding Over Memoryless Noisy Channels Using Higher Order Markov Models
• scientific article; zbMATH DE number 16047 (Why is no real title available?)
• Optimal detection of discrete Markov sources over discrete memoryless channels-applications to combined source-channel coding
• On the cost of finite block length in quantizing unbounded memoryless sources

This page was built for publication: Quantization of memoryless and Gauss-Markov sources over binary Markov channels

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