A Family of Irregular LDPC Codes With Low

Sarah J. Johnson, Steven R. Weller

Published Jan 1, 2003• 0 citations

Related papers

A family of irregular LDPC codes with low encoding complexity

Sarah J. Johnson, Steven R. Weller

We consider irregular quasi-cyclic low-density parity-check (LDPC) codes derived from difference families. The resulting codes can be encoded with low complexity and perform well when iteratively decoded with the sum-product algorithm.

IEEE Communications LettersFeb 1, 2003110 citations

Class of irregular LDPC codes with low encoding complexity

WU Yu-ping

Journal of Jilin UniversityJan 1, 20090 citations

Overview of LDPC codes

Vikram Arkalgud Chandrasetty, Syed Mahfuzul Aziz

Elsevier eBooksDec 12, 20174 citations

A new family of irregular LDPC Codes

Hong Wen, Fei Hu, Han Li +1 more

In this paper, we present a method for constructing irregular LDPC (low density parity check) codes based on the optical orthogonal codes. The resulting codes are quasi-cyclic codes and can be encoded with low complexity. They perform well with the sum-product iterative decoding.

IEEE Circuits and Systems Symposium on Emerging TechnologiesNov 13, 20041 citation

An Introduction to LDPC Codes

Irene Márquez-Corbella, Edgar Martı́nez-Moro

Series on coding theory and cryptologyFeb 1, 20134 citations

Detailed representation of irregular LDPC code ensembles and density evolution

Kazuhiko Kasai, T. Shibuya, K. Sakaniwa

We construct new families of low-density parity-check (LDPC) code ensembles which are subensembles of conventional irregular LDPC code ensembles and develop density evolution for those ensembles. Further, we find an ensemble which has a better threshold than that of its super ensemble.

IEEE International Symposium on Information Theory (ISIT)Jan 1, 200312 citations