# Low-density parity-check codes based on finite geometries: A rediscovery and new results

@article{Kou2001LowdensityPC, title={Low-density parity-check codes based on finite geometries: A rediscovery and new results}, author={Yu Kou and Shu Lin and Marc P. C. Fossorier}, journal={IEEE Trans. Inf. Theory}, year={2001}, volume={47}, pages={2711-2736} }

This paper presents a geometric approach to the construction of low-density parity-check (LDPC) codes. Four classes of LDPC codes are constructed based on the lines and points of Euclidean and projective geometries over finite fields. Codes of these four classes have good minimum distances and their Tanner (1981) graphs have girth 6. Finite-geometry LDPC codes can be decoded in various ways, ranging from low to high decoding complexity and from reasonably good to very good performance. They…

## Figures and Tables from this paper

## 1,276 Citations

Finite Geometry Low Density Parity-Check Codes: Construction, Structure, and Decoding

- Computer Science
- 2002

An algebraic and systematic method for constructing low density parity-check (LDPC) codes from a geometric point of view and they achieve an error performance only a few tenths of a dB away from the Shannon limit with IDBP.

Low density parity check codes: construction based on finite geometries

- Computer ScienceGlobecom '00 - IEEE. Global Telecommunications Conference. Conference Record (Cat. No.00CH37137)
- 2000

This paper presents the first algebraic method for constructing LDPC codes systematically based on finite analytic geometries based on cyclic or quasi-cyclic codes, and four classes of finite geometryLDPC codes with relatively good minimum distances are constructed.

A Class of Quantum LDPC Codes Constructed From Finite Geometries

- Computer ScienceIEEE GLOBECOM 2008 - 2008 IEEE Global Telecommunications Conference
- 2008

A new class of quantum LDPC codes based on lines and points of finite geometries is constructed, adapted to be self- orthogonal with containing only one cycle of length four in each pair of two rows.

LDPC codes from semipartial geometries

- Computer Science
- 2011

The aim of this research is to provide examples of new codes constructed based on structures known as semipartial geometries (SPGs), which are generalisations of partial geometry and may provide more efficient encoding algorithms than randomly-generated codes.

Algebraic Quasi-Cyclic LDPC Codes: Construction, Low Error-Floor, Large Girth and a Reduced-Complexity Decoding Scheme

- Computer ScienceIEEE Transactions on Communications
- 2014

A simple and very flexible method for constructing quasi-cyclic (QC) low density paritycheck (LDPC) codes based on finite fields and a reduced-complexity iterative decoding scheme based on the section-wise cyclic structure of their parity-check matrices is presented.

Iterative decoding of a class of cyclic codes

- Computer Science2010 Information Theory and Applications Workshop (ITA)
- 2010

Two iterative decoding algorithms are devised for this class of cyclic codes and they provide significant coding gain over the two-step majority-logic decoding of codes in this class.

Generalized quasi-cyclic low-density parity-check codes based on finite geometries

- Computer Science2009 IEEE Information Theory Workshop
- 2009

It is proved that several promising classes of codes based on finite geometries cannot be classified as quasi- cyclic (QC) codes but should be included in broader generalized quasi-cyclic (GQC), and an algorithm is proposed for the computation of the Gröbner bases from the parity check matrices of GQC codes.

Iterative Decoding of Codes on Graphs

- Computer Science
- 2006

This report furthers the understanding of the failures in iterative decoders for the binary symmetric channel, and proposes an algorithm that aims to alleviate this drawback by constructing an equivalent graph representation that is free of four cycles.

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

- Computer ScienceISIT
- 2005

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, including duals of one-generator QC codes and a class consisting of codes from circulant permutation matrices.

Quasi-cyclic LDPC codes: an algebraic construction

- Computer ScienceIEEE Transactions on Communications
- 2010

Two new large classes of QC-LDPC codes, one binary and one non-binary, are presented, which have potential to replace Reed-Solomon codes in some communication or storage systems where combinations of random and bursts of errors (or erasures) occur.

## References

SHOWING 1-10 OF 75 REFERENCES

Low density parity check codes based on finite geometries: a rediscovery

- Computer Science2000 IEEE International Symposium on Information Theory (Cat. No.00CH37060)
- 2000

Two classes of high rate LDPC codes whose constructions are based on the lines of two-dimensional finite Euclidean and projective geometries, respectively are presented.

Design of capacity-approaching irregular low-density parity-check codes

- Computer ScienceIEEE Trans. Inf. Theory
- 2001

This work designs low-density parity-check codes that perform at rates extremely close to the Shannon capacity and proves a stability condition which implies an upper bound on the fraction of errors that a belief-propagation decoder can correct when applied to a code induced from a bipartite graph with a given degree distribution.

On majority-logic decoding for duals of primitive polynomial codes

- Computer ScienceIEEE Trans. Inf. Theory
- 1971

In this paper, majority-logic decoding for the duals of certain primitive polynomial codes is considered and the maximality of Euclidean geometry codes is proved.

New generalizations of the Reed-Muller codes-II: Nonprimitive codes

- Computer ScienceIEEE Trans. Inf. Theory
- 1968

A class of nonprimitive cyclic codes quite similar in structure to the original Reed-Muller codes is presented, and it is shown that for given values of code length and rate the codes have relatively large minimum distances.

A recursive approach to low complexity codes

- Computer ScienceIEEE Trans. Inf. Theory
- 1981

It is shown that choosing a transmission order for the digits that is appropriate for the graph and the subcodes can give the code excellent burst-error correction abilities.

Codes and iterative decoding on general graphs

- Computer ScienceEur. Trans. Telecommun.
- 1995

A general framework, based on ideas of Tanner, for the description of codes and iterative decoding (“turbo coding”) is developed, which clarifies, in particular, which a priori probabilities are admissible and how they are properly dealt with.

Codes and Decoding on General Graphs

- Computer Science
- 1996

It is showed that many iterative decoding algorithms are special cases of two generic algorithms, the min-sum and sum-product algorithms, which also include non-iterative algorithms such as Viterbi decoding.

Good Error-Correcting Codes Based on Very Sparse Matrices

- Computer ScienceIEEE Trans. Inf. Theory
- 1999

It is proved that sequences of codes exist which, when optimally decoded, achieve information rates up to the Shannon limit, and experimental results for binary-symmetric channels and Gaussian channels demonstrate that practical performance substantially better than that of standard convolutional and concatenated codes can be achieved.

Difference-set cyclic codes

- Computer Science
- 1966

A new class of random-error-correcting cyclic codes is defined, which has two very desirable features: the binary members of the class are nearly as powerful as the best-known codes in the range of interest, and they can be decoded with the simplest known decoding algorithm.

Number of information symbols in polynomial codes

- Computer ScienceIEEE Trans. Inf. Theory
- 1972

Polynomial codes and their dual codes as introduced by Kasami, Lin, and Peterson have considerable algebraic and geometric structure. It has been shown that these codes contain many well-known…