Title :
On expander codes
Author_Institution :
Ecole Nat. Superieure des Telecommun., Paris, France
fDate :
2/1/2001 12:00:00 AM
Abstract :
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
Keywords :
error correction codes; graph theory; iterative decoding; linear codes; parallel algorithms; Ramanujan graph; asymptotically good code; bipartite graph; decoding algorithm; expander codes; linear error-correcting codes; parallel algorithm; Binary codes; Bipartite graph; Circuits; Costs; Decoding; Entropy; Error correction; Error correction codes; Graph theory; Parallel algorithms;
Journal_Title :
Information Theory, IEEE Transactions on
