Challenges
Datasets
Workspaces
Papers
Discussions
Leaderboard
Log inSign up
Challenges
Datasets
Workspaces
Papers
Discussions
Leaderboard
Blog
Job Board
Q3AS

© 2026 Aqora Quantum S.A.S.

TermsPrivacyLegal Notice

IEEE Transactions on Information Theory

High-Rate Quasi-Cyclic Low-Density Parity-Check Codes Derived From Finite Affine Planes

Norifumi Kamiya

Published Apr 1, 2007• 62 citations
Publisher

Abstract

This paper shows that several attractive classes of quasi-cyclic (QC) low-density parity-check (LDPC) codes can be obtained from affine planes over finite fields. One class of these consists of duals of one-generator QC codes. Presented here for codes contained in this class are the exact minimum distance and a lower bound on the multiplicity of the minimum-weight codewords. Further, it is shown that the minimum Hamming distance of a code in this class is equal to its minimum additive white Gaussian noise (AWGN) pseudoweight. Also discussed is a class consisting of codes from circulant permutation matrices, and an explicit formula for the rank of the parity-check matrix is presented for these codes. Additionally, it is shown that each of these codes can be identified with a code constructed from a constacyclic maximum distance separable code of dimension$2$. The construction is similar to the derivation of Reed–Solomon (RS)-based LDPC codes presented by Chenand DjurdjevicExperimental results show that a number of high rate QC-LDPC codes with excellent error performance are contained in these classes.

DOI
10.1109/tit.2007.892770

Related papers

High-rate quasi-cyclic low-density parity-check codes derived from finite affine planes

Norifumi Kamiya

This paper shows that several attractive classes of quasi-cyclic (QC) low-density parity-check (LDPC) codes can be obtained from affine planes over finite fields. One class of these consists of duals of one-generator QC codes. Here, for codes contained in this class, the exact minimum-distance and a lower bound on the multiplicity of the minimum-weight codewords are presented. It is shown that the lower bound on the multiplicity provides a very accurate indication of the bit error performance at moderate and high signal-to-noise ratios, and thus error-floor behavior can be easily predicted. Also discussed is a class consisting of codes from circulant permutation matrices. An explicit formula for the rank of the parity-check matrix is presented for these codes. Furthermore, it is shown that each of these codes can be identified as a code constructed from a constacyclic maximum distance separable (MDS) code in a similar manner to the RS-based LDPC codes presented by Chen et al. and Djurdjevic et al. Experimental results show that a number of high rate QC-LDPC codes with excellent error performance are contained in these classes

IEEE International Symposium on Information Theory (ISIT)•Jan 1, 2005•0 citations

Two-dimensional generalized Reed-Solomon codes: A unified framework for quasi-cyclic LDPC codes constructed based on finite fields

Chao Chen, Baoming Bai, Xinmei Wang

In this paper, we first propose a general framework for constructing quasi-cyclic low-density parity-check (QC-LDPC) codes based on a two-dimensional (2-D) maximum distance separable (MDS) code. Two classes of QC-LDPC codes are defined, whose parity-check matrices are transposes of each other. We then use a 2-D generalized Reed-Solomon (GRS) code to give a concrete construction. The decoding parity-check matrices have a large number of redundant parity-check equations while their Tanner graphs have a girth of at least 6. The minimum distances of the codes are very respectable as far as LDPC codes are concerned. We further show that many existing constructions of QC-LDPC codes based on finite fields in the literature can be unified under this construction. Experimental studies show that the constructed QC-LDPC codes perform well with the sum-product algorithm (SPA).

IEEE International Symposium on Information Theory (ISIT)•Jun 1, 2010•3 citations

Quasi-Cyclic LDPC Codes on Cyclic Subgroups of Finite Fields

Li Guo Zhang, Shu Lin, Khaled Abdel-Ghaffar +2 more

A new class of quasi-cyclic LDPC codes whose parity-check matrices are arrays of circulant permutation matrices constructed based on cyclic subgroups of finite fields is presented. This class of codes contains several known classes of algebraic quasi-cyclic LDPC codes as subclasses. Experimental results show that the codes constructed perform very well over the AWGN channel when decoded with iterative decoding based on belief propagation. This class of new QC-LDPC codes contains a subclass of codes which have large minimum distances. Combinatorial expressions for the ranks of the parity-check matrices of a subclass of codes constructed based on fields of characteristic two are given.

IEEE Transactions on Communications•Jun 28, 2011•36 citations

Anti Quasi-Cyclic LDPC Codes

Zahra Gholami, Mohammad Gholami

Low-density parity-check (LDPC) codes based on affine permutation matrices, APM-LDPC codes, have been attracted recently, because of some advantages rather than QC-LDPC codes in minimum-distance, cycle distribution and error-rate performance. In this letter, circulant and anti-circulant permutation matrices are used to define a class of LDPC codes, called AQC-LDPC codes, which can be considered as an special case of APM-LDPC codes. In fact, each AQC-LDPC code can be verified by a sign matrix and a slope matrix which are helpful to show each cycle in the Tanner graph by a modular linear equation. For the normal sign matrix A , if -1 ϵ, A, it is shown that the corresponding AQC-LDPC code has maximum-girth 8. Finally, two explicit constructions for AQC-LDPC codes with girths 6, 8 are presented which have some benefits rather than the explicitly constructed QC and APM LDPC codes in minimum-distance, cycle distributions and bit-error-rate performances.

IEEE Communications Letters•Mar 26, 2018•5 citations

Design of Quasi-Cyclic Cycle LDPC Codes over GF(q)

HU Shu-kai, Chao Chen, Rong Xia Sun +1 more

Quasi-cyclic (QC) low-density parity-check (LDPC) codes have several appealing properties regarding decoding, storage requirements and encoding aspects. In this paper, we focus on the QC LDPC codes over GF(q) whose parity-check matrices have fixed column weight j=2. By investigating two subgraphs in the Tanner graphs of the corresponding base matrices, we derive two upper bounds on the minimum Hamming distance for this class of codes. In addition, a method is proposed to construct QC LDPC codes over GF(q), which have good Hamming distance distributions. Simulations show that our designed codes have good performance.

IEICE Transactions on Communications•Jan 1, 2012•0 citations

Rank Analysis of Parity-Check Matrices for Quasi-Cyclic LDPC Codes

Po‐Chun Yang, Chung-Hsuan Wang, Chi-Chao Chao

Quasi-cyclic low-density parity-check (QC-LDPC) codes are an important class of LDPC codes which can be encoded and decoded with low complexity and suitable for many applications. As the code dimension, which describes the number of protected information bits, is equal to the code length minus the rank of the parity-check matrix and the parity-check matrix for QC-LDPC codes is usually not full-rank, determining the rank of the parity-check matrix is of essential importance. In this paper, we study the rank of the parity-check matrix for QC-LDPC codes based on the associated polynomials for circulant matrices. A formula for the rank of the parity-check matrix with only one row-block is first derived. We then extend the result to matrices with two, three, or more row-blocks. Some bounds are also presented for matrices with arbitrary numbers of row-blocks. Furthermore, the exact rank is determined for a class of algebraically constructed parity-check matrices.

IEEE International Symposium on Information Theory (ISIT)•Jun 1, 2018•5 citations
This paper shows that several attractive classes of quasi-cyclic (QC) low-density parity-check (LDPC) codes can be obtained from affine planes over finite fields. One class of these consists of duals of one-generator QC codes. Presented here for codes contained in this class are the exact minimum distance and a lower bound on the multiplicity of the minimum-weight codewords. Further, it is shown that the minimum Hamming distance of a code in this class is equal to its minimum additive white Gaussian noise (AWGN) pseudoweight. Also discussed is a class consisting of codes from circulant permutation matrices, and an explicit formula for the rank of the parity-check matrix is presented for these codes. Additionally, it is shown that each of these codes can be identified with a code constructed from a constacyclic maximum distance separable code of dimension222. The construction is similar to the derivation of Reed–Solomon (RS)-based LDPC codes presented by Chenand DjurdjevicExperimental results show that a number of high rate QC-LDPC codes with excellent error performance are contained in these classes.
This paper shows that several attractive classes of quasi-cyclic (QC) low-density parity-check (LDPC) codes can be obtained from affine planes over finite fields. One class of these consists of duals of one-generator QC codes. Here, for codes contained in this class, the exact minimum-distance and a lower bound on the multiplicity of the minimum-weight codewords are presented. It is shown that the lower bound on the multiplicity provides a very accurate indication of the bit error performance at moderate and high signal-to-noise ratios, and thus error-floor behavior can be easily predicted. Also discussed is a class consisting of codes from circulant permutation matrices. An explicit formula for the rank of the parity-check matrix is presented for these codes. Furthermore, it is shown that each of these codes can be identified as a code constructed from a constacyclic maximum distance separable (MDS) code in a similar manner to the RS-based LDPC codes presented by Chen et al. and Djurdjevic et al. Experimental results show that a number of high rate QC-LDPC codes with excellent error performance are contained in these classes
In this paper, we first propose a general framework for constructing quasi-cyclic low-density parity-check (QC-LDPC) codes based on a two-dimensional (2-D) maximum distance separable (MDS) code. Two classes of QC-LDPC codes are defined, whose parity-check matrices are transposes of each other. We then use a 2-D generalized Reed-Solomon (GRS) code to give a concrete construction. The decoding parity-check matrices have a large number of redundant parity-check equations while their Tanner graphs have a girth of at least 6. The minimum distances of the codes are very respectable as far as LDPC codes are concerned. We further show that many existing constructions of QC-LDPC codes based on finite fields in the literature can be unified under this construction. Experimental studies show that the constructed QC-LDPC codes perform well with the sum-product algorithm (SPA).
A new class of quasi-cyclic LDPC codes whose parity-check matrices are arrays of circulant permutation matrices constructed based on cyclic subgroups of finite fields is presented. This class of codes contains several known classes of algebraic quasi-cyclic LDPC codes as subclasses. Experimental results show that the codes constructed perform very well over the AWGN channel when decoded with iterative decoding based on belief propagation. This class of new QC-LDPC codes contains a subclass of codes which have large minimum distances. Combinatorial expressions for the ranks of the parity-check matrices of a subclass of codes constructed based on fields of characteristic two are given.
Low-density parity-check (LDPC) codes based on affine permutation matrices, APM-LDPC codes, have been attracted recently, because of some advantages rather than QC-LDPC codes in minimum-distance, cycle distribution and error-rate performance. In this letter, circulant and anti-circulant permutation matrices are used to define a class of LDPC codes, called AQC-LDPC codes, which can be considered as an special case of APM-LDPC codes. In fact, each AQC-LDPC code can be verified by a sign matrix and a slope matrix which are helpful to show each cycle in the Tanner graph by a modular linear equation. For the normal sign matrix A , if -1 ϵ, A, it is shown that the corresponding AQC-LDPC code has maximum-girth 8. Finally, two explicit constructions for AQC-LDPC codes with girths 6, 8 are presented which have some benefits rather than the explicitly constructed QC and APM LDPC codes in minimum-distance, cycle distributions and bit-error-rate performances.
Quasi-cyclic (QC) low-density parity-check (LDPC) codes have several appealing properties regarding decoding, storage requirements and encoding aspects. In this paper, we focus on the QC LDPC codes over GF(q) whose parity-check matrices have fixed column weight j=2. By investigating two subgraphs in the Tanner graphs of the corresponding base matrices, we derive two upper bounds on the minimum Hamming distance for this class of codes. In addition, a method is proposed to construct QC LDPC codes over GF(q), which have good Hamming distance distributions. Simulations show that our designed codes have good performance.
Quasi-cyclic low-density parity-check (QC-LDPC) codes are an important class of LDPC codes which can be encoded and decoded with low complexity and suitable for many applications. As the code dimension, which describes the number of protected information bits, is equal to the code length minus the rank of the parity-check matrix and the parity-check matrix for QC-LDPC codes is usually not full-rank, determining the rank of the parity-check matrix is of essential importance. In this paper, we study the rank of the parity-check matrix for QC-LDPC codes based on the associated polynomials for circulant matrices. A formula for the rank of the parity-check matrix with only one row-block is first derived. We then extend the result to matrices with two, three, or more row-blocks. Some bounds are also presented for matrices with arbitrary numbers of row-blocks. Furthermore, the exact rank is determined for a class of algebraically constructed parity-check matrices.