Results on Punctured Low-Density Parity-Check Codes and Improved Iterative Decoding Techniques

Authors:
Hossein Pishro-Nik;Faramarz Fekri
Affiliations:
Sch. of Electr. & Comput. Eng., Massachusetts Univ., Amherst, MA;-
Venue:
IEEE Transactions on Information Theory
Year:
2007

Citing 0
Cited 8

Design and analysis of E2RC codes

IEEE Journal on Selected Areas in Communications - Special issue on capaciyy approaching codes
Toward low LDPC-code floors: a case study

IEEE Transactions on Communications
Parameter selection for Wyner–Ziv coding of laplacian sources with additive laplacian or gaussian innovation

IEEE Transactions on Signal Processing
Waterfall region performance of punctured LDPC codes over the BEC

ISIT'09 Proceedings of the 2009 IEEE international conference on Symposium on Information Theory - Volume 4
An iterative algorithm for trust and reputation management

ISIT'09 Proceedings of the 2009 IEEE international conference on Symposium on Information Theory - Volume 3
On systematic design of universally capacity approaching rate-compatible sequences of LDPC code ensembles over binary-input output-symmetric memoryless channels

Allerton'09 Proceedings of the 47th annual Allerton conference on Communication, control, and computing
Hybrid channel codes for efficient FSO/RF communication systems

IEEE Transactions on Communications
Blind reconciliation

Quantum Information & Computation

Quantified Score

Hi-index	754.84

Visualization

Abstract

This paper first introduces an improved decoding algorithm for low-density parity-check (LDPC) codes over binary-input-output-symmetric memoryless channels. Then some fundamental properties of punctured LDPC codes are presented. It is proved that for any ensemble of LDPC codes, there exists a puncturing threshold. It is then proved that for any rates R1 and R2 satisfying 0