Answers are grounded in this paper and cite their sources.
We report weaknesses in two algebraic constructions of low-density parity-check codes based on expander graphs. The Margulis construction gives a code with near-codewords, which cause problems for the sum-product decoder; The Ramanujan-Margulis construction gives a code with low-weight codewords, which produce an error-floor.
No takes yet. Share an insight, caveat, or question.
Mackay et al. (2003) studied this question.
Synapse has enriched 10 related papers. Consider them for comparative context: