Abstract — In this paper, we provide necessary and sufficient conditions for a column-weight-three LDPC code to correct three errors when decoded using Gallager A algorithm. We then provide a construction technique which results in a code satisfying the above conditions. We also provide numerical assessment of code performance via simulation results. I.

Jan 1, 200819 citations

arXiv:0710.3427

Error Correction Capability of Column-Weight-Three LDPC Codes

Shashi Kiran Chilappagari, Bane V. Vasic

Published Oct 18, 2007• 1 citation

arXiv HTML PDF

Abstract

k \geq 5

errors is to avoid cycles of length up to

2k

in its Tanner graph. As a consequence of this result, we show that given any

α>0, \exists N

such that

\forall n>N

, no code in the ensemble of column-weight-three codes can correct all

αn

or fewer errors. We extend these results to the bit flipping algorithm.

DOI: 10.48550/arxiv.0710.3427

Related papers

Error Correction Capability of Column-Weight-Three LDPC Codes

Bane Vasic, et al.

In this paper, we investigate the error correction capability of column-weight-three LDPC codes when decoded using the Gallager A algorithm. We prove that the necessary condition for a code to correct k ≥ 5 errors is to avoid cycles of length up to 2k in its Tanner graph. As a consequence of this result, we show that given any α> 0, ∃N such that ∀n> N, no code in the ensemble of column-weight-three codes can correct all αn or fewer errors. We extend these results to the bit flipping algorithm.In this paper, we investigate the error correction capability of column-weight-three LDPC codes when decoded using the Gallager A algorithm. We prove that the necessary condition for a code to correct k ≥ 5 errors is to avoid cycles of length up to 2k in its Tanner graph. As a consequence of this result, we show that given any α> 0, ∃N such that ∀n> N, no code in the ensemble of column-weight-three codes can correct all αn or fewer errors. We extend these results to the bit flipping algorithm.

Jan 1, 200738 citations

Error-Correction Capability of Column-Weight-Three LDPC Codes

Shashi Kiran Chilappagari, Bane Vasic

In this paper, the error-correction capability of column-weight-three low-density parity-check (LDPC) codes when decoded using the Gallager A algorithm is investigated. It is proved that a necessary condition for a code to correct all error patterns with up to k ges 5 errors is to avoid cycles of length up to 2k in its Tanner graph. As a consequence of this result, it is shown that given any alpha > 0, exist N such that forall n > N, no code in the ensemble of column-weight-three codes can correct all alphan or fewer errors. The results are extended to the bit flipping algorithms.In this paper, the error-correction capability of column-weight-three low-density parity-check (LDPC) codes when decoded using the Gallager A algorithm is investigated. It is proved that a necessary condition for a code to correct all error patterns with up to k ges 5 errors is to avoid cycles of length up to 2k in its Tanner graph. As a consequence of this result, it is shown that given any alpha > 0, exist N such that forall n > N, no code in the ensemble of column-weight-three codes can correct all alphan or fewer errors. The results are extended to the bit flipping algorithms.

arXiv:0807.3582IEEE Transactions on Information TheoryApr 22, 200938 citations

Error Correction Capability of Column-Weight-Three LDPC Codes Under the Gallager A Algorithm—Part II

Shashi Kiran Chilappagari, Dung Viet Nguyen, Bane V. Vasic +1 more

The relation between the girth and the error correction capability of column-weight-three LDPC codes under the Gallager A algorithm is investigated. It is shown that a column-weight-three LDPC code with Tanner graph of girthg¿ 10 can correct all error patterns with up to(g/2-1) errors in at mostg/2 iterations of the Gallager A algorithm. For codes with Tanner graphs of girthg¿ 8, it is shown that girth alone cannot guarantee correction of all error patterns with up to(g/2-1) errors under the Gallager A algorithm. Sufficient conditions to correct(g/2-1) errors are then established by studying trapping sets.The relation between the girth and the error correction capability of column-weight-three LDPC codes under the Gallager A algorithm is investigated. It is shown that a column-weight-three LDPC code with Tanner graph of girthg¿ 10 can correct all error patterns with up to(g/2-1) errors in at mostg/2 iterations of the Gallager A algorithm. For codes with Tanner graphs of girthg¿ 8, it is shown that girth alone cannot guarantee correction of all error patterns with up to(g/2-1) errors under the Gallager A algorithm. Sufficient conditions to correct(g/2-1) errors are then established by studying trapping sets.

IEEE Transactions on Information TheoryMay 27, 201020 citations

On error correction capability of bit-flipping algorithm for LDPC codes

Wen-Yao Chen, Chung-Chin Lu

The error correction capability of bit-flipping decoding algorithm for low density parity-check (LDPC) codes is studied by introducing variable node adjacency (VNA) graphs which are derived from Tanner graphs of LDPC codes. For codes with column weight λ and girth g = 8, it can be shown that error patterns of weight less than or equal to λ - 1 can be corrected. This result implies that the bit-flipping algorithm could decode up to the random error-correcting capability over binary symmetric channel for girth 8 codes whose random error-correcting capability is equal to λ - 1.The error correction capability of bit-flipping decoding algorithm for low density parity-check (LDPC) codes is studied by introducing variable node adjacency (VNA) graphs which are derived from Tanner graphs of LDPC codes. For codes with column weight λ and girth g = 8, it can be shown that error patterns of weight less than or equal to λ - 1 can be corrected. This result implies that the bit-flipping algorithm could decode up to the random error-correcting capability over binary symmetric channel for girth 8 codes whose random error-correcting capability is equal to λ - 1.

IEEE International Symposium on Information Theory (ISIT)Jul 1, 20116 citations

Girth of the Tanner graph and error correction capability of LDPC codes

Shashi Kiran Chilappagari, Dung Viet Nguyen, Bane V. Vasic +1 more

We investigate the relation between the girth and the guaranteed error correction capability of γ-left regular LDPC codes. For column-weight-three codes, we give upper and lower bounds on the number of errors correctable by the Gallager A algorithm. For higher column weight codes, we find the number of variable nodes which are guaranteed to expand by a factor of at least 3γ/4, hence giving a lower bound on the guaranteed correction capability under the bit flipping (serial and parallel) algorithms. We also establish upper bounds by studying the sizes of smallest possible trapping sets.We investigate the relation between the girth and the guaranteed error correction capability of γ-left regular LDPC codes. For column-weight-three codes, we give upper and lower bounds on the number of errors correctable by the Gallager A algorithm. For higher column weight codes, we find the number of variable nodes which are guaranteed to expand by a factor of at least 3γ/4, hence giving a lower bound on the guaranteed correction capability under the bit flipping (serial and parallel) algorithms. We also establish upper bounds by studying the sizes of smallest possible trapping sets.

Allerton Conference on Communication, Control, and ComputingSep 1, 20087 citations

LDPC codes which can correct three errors under iterative decoding

Anantha Raman Krishnan, Bane V. Vasic

Jan 1, 200819 citations

k \geq 5

errors is to avoid cycles of length up to

2k

in its Tanner graph. As a consequence of this result, we show that given any

α>0, \exists N

such that

\forall n>N

, no code in the ensemble of column-weight-three codes can correct all

αn

or fewer errors. We extend these results to the bit flipping algorithm.