On Expander Codes
Download:
|
|
unknown authors
http://www.enst.fr/~zemor/expander.ps
Add To MetaCart
Abstract:
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. Index terms. Expander code, Ramanujan graph, Decoding. 1
Citations
| 1287 | The Theory of Error-Correcting Codes – MacWilliams, Sloane - 1978 |
| 204 | A recursive approach to low complexity codes – Tanner - 1981 |
| 200 | Ramanujan graphs – Lubotzky, Philips, et al. - 1988 |
| 167 | Expander codes – Sipser, Spielman - 1996 |
| 151 | Explicit group theoretical constructions of combinatorial schemes and their applications to the design of expanders and concentrators, Problemy Peredachi Informatsii 24 (1 – Margulis - 1988 |
| 75 | Explicit construction of linear sized tolerant networks – Alon, Chung - 1986 |
