Low density parity check codes over GF(q)

Author

Davey, Hllatthew C. ; MacKay, David J C

Author_Institution

Cavendish Lab., Cambridge Univ., UK

fYear

1998

fDate

22-26 Jun 1998

Firstpage

70

Lastpage

71

Abstract

Binary low density parity check (LDPC) codes have been shown to have near Shannon limit performance when decoded using a probabilistic decoding algorithm. The analogous codes defined over finite fields GF(q) of order q>2 show significantly improved performance. We present the results of Monte Carlo simulations of the decoding of infinite LDPC codes which can be used to obtain good constructions for finite codes. We also present empirical results for the Gaussian channel including a rate 1/4 code with bit error probability of 10^-4 at E_b/N₀=-0.05 dB

Keywords

Galois fields; Gaussian channels; Monte Carlo methods; channel coding; decoding; error correction codes; error statistics; GF(q); Gaussian channel; LDPC codes; Monte Carlo simulations; Shannon limit performance; binary low density parity check codes; bit error probability; finite codes; finite fields; low density parity check codes; performance; probabilistic decoding algorithm; rate 1/4 code; Belief propagation; Error correction codes; Error probability; Galois fields; Gaussian channels; Iterative decoding; Laboratories; Parity check codes; Sparse matrices; Symmetric matrices;

fLanguage

English

Publisher

ieee

Conference_Titel

Information Theory Workshop, 1998

Conference_Location

Killarney

Print_ISBN

0-7803-4408-1

Type

conf

DOI

10.1109/ITW.1998.706440

Filename

706440