Capacity Achieving LDPC Codes Through Puncturing

DOI10.1109/TIT.2008.928274MaRDI QIDQ3604942zbMATH OpenOpenAlexFDO

Authors Chun-Hao Hsu, Achilleas Anastasopoulos

Publication date 24 February 2009

Published in IEEE Transactions on Information Theory (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1109/tit.2008.928274

Mathematics Subject Classification ID

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

Recommendations

• Results on Punctured Low-Density Parity-Check Codes and Improved Iterative Decoding Techniques
• Rate-Compatible Puncturing of Low-Density Parity-Check Codes
• Rate-compatible punctured low-density parity-check codes with short block lengths
• On Achievable Rates and Complexity of LDPC Codes Over Parallel Channels: Bounds and Applications
• The capacity of low-density parity-check codes under message-passing decoding

Cited in

(5)

• Punctured turbo-codes for BPSK/QPSK channels
• Rate-compatible punctured low-density parity-check codes with short block lengths
• Rate-Compatible Puncturing of Low-Density Parity-Check Codes
• Results on Punctured Low-Density Parity-Check Codes and Improved Iterative Decoding Techniques
• On Achievable Rates and Complexity of LDPC Codes Over Parallel Channels: Bounds and Applications

This page was built for publication: Capacity Achieving LDPC Codes Through Puncturing

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