On Designing Good LDPC Codes for Markov Channels

DOI10.1109/TIT.2006.887467MaRDI QIDQ3548900zbMATH OpenOpenAlexDBLPWikidataFDO

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

zbMATH Keywords

channels with memoryhidden Markov chainlow-density parity-check (LDPC) codes

Mathematics Subject Classification ID

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

Recommendations

• Analysis of Low-Density Parity-Check Codes for the Gilbert–Elliott Channel
• Analysis of sum-product decoding of low-density parity-check codes using a Gaussian approximation
• Efficient encoding of low-density parity-check codes
• Design of capacity-approaching irregular low-density parity-check codes
• The capacity of low-density parity-check codes under message-passing decoding

Cited in

(9)

• An accurate density evolution analysis for a finite-state Markov channel
• Analysis of Low-Density Parity-Check Codes for the Gilbert–Elliott Channel
• Upper Bounds on the Rate of LDPC Codes for a Class of Finite-State Markov Channels
• A Partial Ordering of General Finite-State Markov Channels Under LDPC Decoding
• Efficient Serial Message-Passing Schedules for LDPC Decoding
• Analysis of sum-product decoding of low-density parity-check codes using a Gaussian approximation
• Applied Algebra, Algebraic Algorithms and Error-Correcting Codes
• LDPC code design for nonuniform power-line channels
• Characterization and optimization of LDPC codes for the 2-user Gaussian multiple access channel

This page was built for publication: On Designing Good LDPC Codes for Markov Channels

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