Efficient Source Decoding Over Memoryless Noisy Channels Using Higher Order Markov Models

DOI10.1109/TIT.2004.833337MaRDI QIDQ3547200zbMATH OpenOpenAlexFDO

Authors Farshad Lahouti, A. K. Khandani

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.833337

Mathematics Subject Classification ID

Coding theorems (Shannon theory) (94A24) Decoding (94B35)

Recommendations

• Iterative Source-Channel Decoding With Markov Random Field Source Models
• 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
• scientific article; zbMATH DE number 3503120
• On asymptotically optimal methods of prediction and adaptive coding for Markov sources
• scientific article; zbMATH DE number 1285526
• Efficient backward decoding of high-order hidden Markov models
• Quantization of memoryless and Gauss-Markov sources over binary Markov channels
• A Partial Ordering of General Finite-State Markov Channels Under LDPC Decoding

Cited in

(4)

• Markov model aided decoding for image transmission using soft-decision-feedback
• Symbol-Based Modeling and Coding of Block Markov Sources
• Optimal detection of discrete Markov sources over discrete memoryless channels-applications to combined source-channel coding
• scientific article; zbMATH DE number 2226638 (Why is no real title available?)

This page was built for publication: Efficient Source Decoding Over Memoryless Noisy Channels Using Higher Order Markov Models

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