Decoding Shortened Cyclic Codes by Belief Propagation
Simon T Wilson and David J C MacKay
Gallager's low density parity check codes 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 same algorithm applied to the decoding of shortened cyclic codes,
a problem arising in cryptanalysis.
postscript.
David MacKay's:
home page,
publications.
bibtex file.