Sipser and Spielman (see ibid., vol.42, p.1717-22, Nov. 1996) have introduced a constructive family of asymptotically good linear error-correcting codes-expander codes-together with a simple parallel algorithm that will always remove a constant fraction of errors. We introduce a variation on their decoding algorithm that, with no extra cost in complexity, provably corrects up to 12 times more errors.
No takes yet. Share an insight, caveat, or question.
Gilles Zémor (2001) studied this question.
Synapse has enriched 2 closely related papers on similar clinical questions. Consider them for comparative context: