Construction of Quasi-Cyclic LDPC Codes for AWGN and Binary Erasure Channels: A Finite Field Approach

@article{Lan2007ConstructionOQ,
  title={Construction of Quasi-Cyclic LDPC Codes for AWGN and Binary Erasure Channels: A Finite Field Approach},
  author={Lan Lan and Lingqi Zeng and Ying Yu Tai and Lei Chen and Shu Lin and Khaled A. S. Abdel-Ghaffar},
  journal={IEEE Transactions on Information Theory},
  year={2007},
  volume={53},
  pages={2429-2458}
}
In the late 1950s and early 1960s, finite fields were successfully used to construct linear block codes, especially cyclic codes, with large minimum distances for hard-decision algebraic decoding, such as Bose-Chaudhuri-Hocquenghem (BCH) and Reed-Solomon (RS) codes. This paper shows that finite fields can also be successfully used to construct algebraic low-density parity-check (LDPC) codes for iterative soft-decision decoding. Methods of construction are presented. LDPC codes constructed by… CONTINUE READING
Highly Influential
This paper has highly influenced 22 other papers. REVIEW HIGHLY INFLUENTIAL CITATIONS
Highly Cited
This paper has 354 citations. REVIEW CITATIONS
171 Extracted Citations
56 Extracted References
Similar Papers

Citing Papers

Publications influenced by this paper.
Showing 1-10 of 171 extracted citations

355 Citations

0204060'07'09'11'13'15'17
Citations per Year
Semantic Scholar estimates that this publication has 355 citations based on the available data.

See our FAQ for additional information.

Referenced Papers

Publications referenced by this paper.
Showing 1-10 of 56 references

LDPC performance vs. number of iterations

  • K. Andrews, C. Jones, S. Dolinar, F. Pollara
  • Proc. The Consultative Committee for Space Data…
  • 2005
Highly Influential
4 Excerpts

Similar Papers

Loading similar papers…