Upper Bounds on the Rate of LDPC Codes for a Class of Finite-State Markov Channels

DOI10.1109/TIT.2006.887511MaRDI QIDQ3548075zbMATH OpenOpenAlexFDO

Authors Pulkit Grover, A. K. Chaturvedi

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

zbMATH Keywords

low-density parity-check (LDPC) codes

Mathematics Subject Classification ID

Channel models (including quantum) in information and communication theory (94A40) Decoding (94B35) Bounds on codes (94B65)

Recommendations

• Upper bounds on the rate of LDPC codes
• Upper bounds on the rate of LDPC codes as a function of minimum distance
• 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

Cited in

(4)

• An accurate density evolution analysis for a finite-state Markov channel
• A Partial Ordering of General Finite-State Markov Channels Under LDPC Decoding
• Upper bounds on the rate of LDPC codes
• Tighter Bounds on the Capacity of Finite-State Channels Via Markov Set-Chains

This page was built for publication: Upper Bounds on the Rate of LDPC Codes for a Class of Finite-State Markov Channels

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