Three algebraic methods for constructing nonbinary LDPC codes based on finite fields

Keke Liu*, Zesong Fei, Jingming Kuang

*Corresponding author for this work

Research output: Chapter in Book/Report/Conference proceedingConference contributionpeer-review

4 Citations (Scopus)

Abstract

In this paper, we present three algebraic methods for constructing structured nonbinary LDPC codes over finite fields, among which the first method is used to construct quasi-cyclic codes with girth at least 6 based on the automorphisms of finite fields, the second method gives a class of (4, ρ) quasi-cyclic codes with girth at least 8, the third method gives a class of codes with cycles limited. Simulation results show that the constructed codes perform very well over AWGN channel, and they have better performances or far lower computational complexities than the corresponding random Mackay codes or codes algebraically constructed by Lin.

Original languageEnglish
Title of host publication2008 IEEE 19th International Symposium on Personal, Indoor and Mobile Radio Communications, PIMRC 2008
DOIs
Publication statusPublished - 2008
Event2008 IEEE 19th International Symposium on Personal, Indoor and Mobile Radio Communications, PIMRC 2008 - Poznan, Poland
Duration: 15 Sept 200818 Sept 2008

Publication series

NameIEEE International Symposium on Personal, Indoor and Mobile Radio Communications, PIMRC

Conference

Conference2008 IEEE 19th International Symposium on Personal, Indoor and Mobile Radio Communications, PIMRC 2008
Country/TerritoryPoland
CityPoznan
Period15/09/0818/09/08

Keywords

  • Automorphism
  • Cycles-limited LDPC codes
  • Finite fields
  • Nonbinary LDPC codes

Fingerprint

Dive into the research topics of 'Three algebraic methods for constructing nonbinary LDPC codes based on finite fields'. Together they form a unique fingerprint.

Cite this