Quasi-Cyclic Low-Density Parity-Check Codes With Girth Larger Than
A quasi-cyclic (QC) low-density parity-check (LDPC) code can be viewed as the protograph
code with circulant permutation matrices (or circulants). In this correspondence, we find all …
code with circulant permutation matrices (or circulants). In this correspondence, we find all …
Design of multiple-edge protographs for QC LDPC codes avoiding short inevitable cycles
There have been lots of efforts on the construction of quasi-cyclic (QC) low-density parity-
check (LDPC) codes with large girth. However, most of them focus on protographs with …
check (LDPC) codes with large girth. However, most of them focus on protographs with …
On the girth of quasi-cyclic protograph LDPC codes
M Karimi, AH Banihashemi - IEEE transactions on information …, 2013 - ieeexplore.ieee.org
In this paper, we study the relationships between the girth of the Tanner graph of a quasi-
cyclic (QC) protograph low-density parity-check (LDPC) code, the lifting degree, and the size …
cyclic (QC) protograph low-density parity-check (LDPC) code, the lifting degree, and the size …
Quasicyclic low-density parity-check codes from circulant permutation matrices
MPC Fossorier - IEEE transactions on information theory, 2004 - ieeexplore.ieee.org
In this correspondence, the construction of low-density parity-check (LDPC) codes from
circulant permutation matrices is investigated. It is shown that such codes cannot have a …
circulant permutation matrices is investigated. It is shown that such codes cannot have a …
Quasi-cyclic LDPC codes based on pre-lifted protographs
DGM Mitchell, R Smarandache… - IEEE Transactions on …, 2014 - ieeexplore.ieee.org
Quasi-cyclic low-density parity-check (QC-LDPC) codes based on protographs are of great
interest to code designers because analysis and implementation are facilitated by the …
interest to code designers because analysis and implementation are facilitated by the …
Efficient search of girth-optimal QC-LDPC codes
A Tasdighi, AH Banihashemi… - IEEE Transactions on …, 2016 - ieeexplore.ieee.org
In this paper, we study the cycle structure of quasi-cyclic (QC) low-density parity-check
(LDPC) codes with the goal of obtaining the shortest code with a given degree distribution …
(LDPC) codes with the goal of obtaining the shortest code with a given degree distribution …
Quasicyclic low density parity check codes
M Fossorier - IEEE International Symposium on Information …, 2003 - ieeexplore.ieee.org
In this work, the construction of low density parity check codes (LDPCs) from circulant
permutation matrices is investigated. It is shown that such codes can not have a Tanner …
permutation matrices is investigated. It is shown that such codes can not have a Tanner …
Construction of nonbinary quasi-cyclic LDPC cycle codes based on singer perfect difference set
C Chen, B Bai, X Wang - IEEE Communications letters, 2010 - ieeexplore.ieee.org
A low-density parity-check (LDPC) code whose parity-check matrix consists of weight-2
columns is known as a cycle code. In this letter, we propose a construction of nonbinary …
columns is known as a cycle code. In this letter, we propose a construction of nonbinary …
Quasi-cyclic LDPC codes: Influence of proto-and Tanner-graph structure on minimum Hamming distance upper bounds
R Smarandache, PO Vontobel - IEEE Transactions on …, 2012 - ieeexplore.ieee.org
Quasi-cyclic (QC) low-density parity-check (LDPC) codes are an important instance of proto-
graph-based LDPC codes. In this paper we present upper bounds on the minimum …
graph-based LDPC codes. In this paper we present upper bounds on the minimum …
A necessary and sufficient condition for determining the girth of quasi-cyclic LDPC codes
The parity-check matrix of a quasi-cyclic low-density parity-check (QC-LDPC) code can be
compactly represented by a polynomial parity-check matrix. By using this compact …
compactly represented by a polynomial parity-check matrix. By using this compact …