Add to ORKGAbstract-This article presents a method for constructing large girth column-weight 2 QC-LDPC codes. A distance graph is first constructed using an existing method. The distance graph is then converted into a Tanner graph. The proposed method could easily construct codes with girths large than 12 and is more flexible compared to previous methods. Obtained codes show good bit error rate performance comparable to that of random codes
Type-II quasi-cyclic (QC) LDPC codes are constructed from combinations of weight-0, weight-1 and wei...
In this paper, we study the relationships between the girth of the Tanner graph of a quasi-cyclic (Q...
In this paper, we aim at constructing high-rate quasi-cyclic low-density parity-check (QC-LDPC) code...
Copyright © 2007 G. Malema and M. Liebelt. This is an open access article distributed under the Crea...
LDPC codes of column weight of two are constructed from minimal distance graphs or cages. Distance ...
LDPC codes of column weight of two are constructed from minimal distance graphs or cages. Distance g...
Abstract: Type II and III low-density parity-check codes (QC-LDPC) codes have been shown to have bet...
Copyright © 2007 G. Malema and M. Liebelt. This is an Open Access article distributed under the Crea...
© Copyright 2006 IEEEIn this paper a modified bit-filling algorithm is used for constructing column-...
In this paper, we study the cycle structure of quasi-cyclic (QC) low-density parity-check (LDPC) cod...
In this paper, we aim at constructing high-rate quasi-cyclic low-density parity-check (QC-LDPC) code...
In this paper, all subgraph patterns of protographs which prevent quasi-cyclic (QC) low-density pari...
A new method using Hamming codes to construct base matrices of (J, K)-regular LDPC convolutional cod...
This paper presents a class of regular quasi-cyclic (QC) LDPC codes whose Tanner graphs have girth a...
In this letter, we propose a new technique to design quasi-cyclic low-density parity-check (QC-LDPC)...
Type-II quasi-cyclic (QC) LDPC codes are constructed from combinations of weight-0, weight-1 and wei...
In this paper, we study the relationships between the girth of the Tanner graph of a quasi-cyclic (Q...
In this paper, we aim at constructing high-rate quasi-cyclic low-density parity-check (QC-LDPC) code...
Copyright © 2007 G. Malema and M. Liebelt. This is an open access article distributed under the Crea...
LDPC codes of column weight of two are constructed from minimal distance graphs or cages. Distance ...
LDPC codes of column weight of two are constructed from minimal distance graphs or cages. Distance g...
Abstract: Type II and III low-density parity-check codes (QC-LDPC) codes have been shown to have bet...
Copyright © 2007 G. Malema and M. Liebelt. This is an Open Access article distributed under the Crea...
© Copyright 2006 IEEEIn this paper a modified bit-filling algorithm is used for constructing column-...
In this paper, we study the cycle structure of quasi-cyclic (QC) low-density parity-check (LDPC) cod...
In this paper, we aim at constructing high-rate quasi-cyclic low-density parity-check (QC-LDPC) code...
In this paper, all subgraph patterns of protographs which prevent quasi-cyclic (QC) low-density pari...
A new method using Hamming codes to construct base matrices of (J, K)-regular LDPC convolutional cod...
This paper presents a class of regular quasi-cyclic (QC) LDPC codes whose Tanner graphs have girth a...
In this letter, we propose a new technique to design quasi-cyclic low-density parity-check (QC-LDPC)...
Type-II quasi-cyclic (QC) LDPC codes are constructed from combinations of weight-0, weight-1 and wei...
In this paper, we study the relationships between the girth of the Tanner graph of a quasi-cyclic (Q...
In this paper, we aim at constructing high-rate quasi-cyclic low-density parity-check (QC-LDPC) code...