Relationships between Sparse Graph Codes
David J C MacKay
The best error-correcting codes that are known at
present are irregular Gallager codes.
Finding the best way to construct the parity check matrix
of these codes is still an active research area.
This note reviews some of the issues, and uses the
notation of generalized parity check matrices to
relate irregular Gallager codes to turbo codes, repeat-accumulate
codes, and the MN codes
used by
Kanter and Saad.
Nine research questions are posed.
postscript (Cambridge UK).
postscript (Canada mirror).
David MacKay's:
home page,
publications.
bibtex file.
Canadian mirrors:
home page,
publications.
bibtex file.