Novel algebraic constructions of nonbinary structured LDPC codes over finite fields

Keke Liu*, Zesong Fei, Jingming Kuang

*Corresponding author for this work

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

5 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 based on the multiplicative inverses of nonzero elements in finite fields and gives a class of quasi-cyclic codes with girth 6, the second method gives a class of (3, ρ) quasi-cyclic codes with girth 8, the third method gives a class of structured codes with cycles limited. The codes given in examples perform well over AWGN channel and have better performances or far lower computational complexities than the corresponding random Mackay codes or codes algebraically constructed by Shu Lin.

Original languageEnglish
Title of host publicationThe 68th IEEE Vehicular Technology Conference, VTC 2008-Fall
DOIs
Publication statusPublished - 2008
Event68th Semi-Annual IEEE Vehicular Technology, VTC 2008-Fall, Conference - Calgary, AB, Canada
Duration: 21 Sept 200824 Sept 2008

Publication series

NameIEEE Vehicular Technology Conference
ISSN (Print)1550-2252

Conference

Conference68th Semi-Annual IEEE Vehicular Technology, VTC 2008-Fall, Conference
Country/TerritoryCanada
CityCalgary, AB
Period21/09/0824/09/08

Keywords

  • Cycles-limited LDPC codes
  • Finite fields
  • Multiplicative inverses
  • Nonbinary LDPC codes

Fingerprint

Dive into the research topics of 'Novel algebraic constructions of nonbinary structured LDPC codes over finite fields'. Together they form a unique fingerprint.

Cite this