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 unified approach to the construction of binary and nonbinary quasi-cyclic LDPC codes based on finite fields
S Song, B Zhou, S Lin… - IEEE Transactions on …, 2009 - ieeexplore.ieee.org
A unified approach for constructing binary and nonbinary quasi-cyclic LDPC codes under a
single framework is presented. Six classes of binary and nonbinary quasi-cyclic LDPC …
single framework is presented. Six classes of binary and nonbinary quasi-cyclic LDPC …
Algebraic construction of sparse matrices with large girth
ME O'Sullivan - IEEE Transactions on Information Theory, 2006 - ieeexplore.ieee.org
In this correspondence, we present a method for constructing sparse matrices that have a
compact description and whose associated bipartite graphs have large girth. Based on an …
compact description and whose associated bipartite graphs have large girth. Based on an …
Searching for voltage graph-based LDPC tailbiting codes with large girth
IE Bocharova, F Hug, R Johannesson… - IEEE Transactions …, 2011 - ieeexplore.ieee.org
The relation between parity-check matrices of quasi-cyclic (QC) low-density parity-check
(LDPC) codes and biadjacency matrices of bipartite graphs supports searching for powerful …
(LDPC) codes and biadjacency matrices of bipartite graphs supports searching for powerful …
Entanglement-assisted quantum quasicyclic low-density parity-check codes
We investigate the construction of quantum low-density parity-check (LDPC) codes from
classical quasicyclic (QC) LDPC codes with girth greater than or equal to 6. We have shown …
classical quasicyclic (QC) LDPC codes with girth greater than or equal to 6. We have shown …
A matrix-theoretic approach for analyzing quasi-cyclic low-density parity-check codes
A matrix-theoretic approach for studying quasi-cyclic codes based on matrix transformations
via Fourier transforms and row and column permutations is developed. These …
via Fourier transforms and row and column permutations is developed. These …
Constructions of type-II QC-LDPC codes with girth eight from Sidon sequence
In this paper, we consider the constructions of type-II quasi-cyclic (QC) low-density parity-
check (LDPC) codes with girth eight from a Sidon sequence. We first derive the necessary …
check (LDPC) codes with girth eight from a Sidon sequence. We first derive the necessary …
Efficient quantum stabilizer codes: LDPC and LDPC-convolutional constructions
P Tan, J Li - IEEE Transactions on Information Theory, 2009 - ieeexplore.ieee.org
Existing quantum stabilizer codes constructed from the classic binary codes exclusively
belong to the special subclass of Calderbank-Shor-Steane (CSS) codes. This paper fills in …
belong to the special subclass of Calderbank-Shor-Steane (CSS) codes. This paper fills in …
Optimal overlapped message passing decoding of quasi-cyclic LDPC codes
Y Dai, Z Yan, N Chen - IEEE transactions on very large scale …, 2008 - ieeexplore.ieee.org
Efficient hardware implementation of low-density parity-check (LDPC) codes is of great
interest since LDPC codes are being considered for a wide range of applications. Recently …
interest since LDPC codes are being considered for a wide range of applications. Recently …
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 …