Monte Carlo simulations of infinite low density parity check
codes over GF(q)
Matthew C. Davey and David J.C. MacKay
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. Our empirical results for the Gaussian channel include
a rate 1/4 code with bit error probability of 10^{-4} at
E_b/N_0=-0.05dB.
- Status:
- Published in the proceedings of the International
Workshop on Optimal Codes and Related Topics (OC98), Bulgaria,
June 9-15 1998.}
Compressed postscript file.