On Achievable Rates and Complexity of LDPC Codes for Parallel Channels: Information-Theoretic Bounds and Applications

2005/12/18 by Igal Sason, Sason, Igal, Gil Wiechman +1
Computer Science · Engineering · #Advanced Wireless Communication Techniques #Cooperative Communication and Network Coding #Error Correcting Code Techniques #FOS: Computer and information sciences #Information Theory (cs.IT)

paper · pdf · doi:10.48550/arxiv.cs/0512076

openalex publication_date 2005/12/18 · openalex created_date 2025/10/10 · openalex updated_date 2026/07/28

Abstract

The paper presents bounds on the achievable rates and the decoding complexity of low-density parity-check (LDPC) codes. It is assumed that the communication of these codes takes place over statistically independent parallel channels where these channels are memoryless, binary-input and output-symmetric (MBIOS). The bounds are applied to punctured LDPC codes. A diagram concludes our discussion by showing interconnections between the theorems in this paper and some previously reported results.

Related

• On Achievable Rates and Complexity of LDPC Codes for Parallel Channels with Application to Puncturing
• Performance versus Complexity Per Iteration for Low-Density Parity-Check Codes: An Information-Theoretic Approach
• On the Parity-Check Density and Achievable Rates of LDPC Codes
• Improved Bounds on the Parity-Check Density and Achievable Rates of Binary Linear Block Codes with Applications to LDPC Codes
• Finite-Dimensional Bounds on Zm and Binary LDPC Codes with Belief Propagation Decoders