Expander Codes

Sipser and Spielman 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.

• Type: Conference
• Year: 1994
• Where: FOCS
• Authors: Michael Sipser, Daniel A. Spielman
• Keywords: Constant Fraction, Constructive Family, FOCS 1994, Simple Parallel Algorithm, Theoretical Computer Science