A Partial Ordering of General Finite-State Markov Channels Under LDPC Decoding

DOI10.1109/TIT.2007.896877MaRDI QIDQ3548164zbMATH OpenWikidataFDO

Authors Andrew W. Eckford, Frank R. Kschischang, S. Pasupathy

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

Mathematics Subject Classification ID

Channel models (including quantum) in information and communication theory (94A40) Decoding (94B35)

Recommendations

• Upper Bounds on the Rate of LDPC Codes for a Class of Finite-State Markov Channels
• An accurate density evolution analysis for a finite-state Markov channel
• On Designing Good LDPC Codes for Markov Channels
• Analysis of Low-Density Parity-Check Codes for the Gilbert–Elliott Channel
• Capacity, mutual information, and coding for finite-state Markov channels

Cited in

(2)

• An accurate density evolution analysis for a finite-state Markov channel
• Efficient Source Decoding Over Memoryless Noisy Channels Using Higher Order Markov Models

This page was built for publication: A Partial Ordering of General Finite-State Markov Channels Under LDPC Decoding

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