Low Density Parity Check Codes over GF(q)
David J C MacKay
Gallager's low density parity check codes over GF(2) have been shown to
have near-Shannon limit performance when decoded using a probabilistic
decoding algorithm. In this paper we report the empirical performance of
the analogous codes defined over GF(q) for q > 2.
postscript.
David MacKay's:
home page,
publications.
bibtex file.