On Achievable Rates and Complexity of LDPC Codes Over Parallel Channels: Bounds and Applications

DOI10.1109/TIT.2006.889462MaRDI QIDQ3548287zbMATH OpenFDO

Authors Gil Wiechman, Igal Sason

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

Mathematics Subject Classification ID

Coding theorems (Shannon theory) (94A24) Channel models (including quantum) in information and communication theory (94A40) Other types of codes (94B60)

Recommendations

• Parity-Check Density Versus Performance of Binary Linear Block Codes: New Bounds and Applications
• Upper bounds on the rate of LDPC codes
• Results on Punctured Low-Density Parity-Check Codes and Improved Iterative Decoding Techniques
• Performance of low-density parity-check codes with linear minimum distance
• Capacity Achieving LDPC Codes Through Puncturing

Cited in

(5)

• Reliable channel regions for good binary codes transmitted over parallel channels
• Constrained Information Combining: Theory and Applications for LDPC Coded Systems
• Parity-Check Density Versus Performance of Binary Linear Block Codes: New Bounds and Applications
• Capacity Achieving LDPC Codes Through Puncturing
• LDPC Codes Over the $q$ -ary Multi-Bit Channel

This page was built for publication: On Achievable Rates and Complexity of LDPC Codes Over Parallel Channels: Bounds and Applications

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