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

DOI10.1109/TIT.2004.833337zbMATH Open1297.94020OpenAlexW2130279916MaRDI QIDQ3547200

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

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

Related Items (1)

Symbol-Based Modeling and Coding of Block Markov Sources

Recommendations

• Title not available (Why is that?) 👍 👎
• Title not available (Why is that?) 👍 👎
• Efficient backward decoding of high-order hidden Markov models 👍 👎
• On asymptotically optimal methods of prediction and adaptive coding for Markov sources 👍 👎
• Noiseless coding of binary finite-order Markov sources (Corresp.) 👍 👎
• A Partial Ordering of General Finite-State Markov Channels Under LDPC Decoding 👍 👎
• Optimal detection of discrete Markov sources over discrete memoryless channels-applications to combined source-channel coding 👍 👎
• Quantization of memoryless and Gauss-Markov sources over binary Markov channels 👍 👎
• Iterative Source-Channel Decoding With Markov Random Field Source Models 👍 👎

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)