DocumentCode
1454315
Title
On expander codes
Author
Zémor, Gilles
Author_Institution
Ecole Nat. Superieure des Telecommun., Paris, France
Volume
47
Issue
2
fYear
2001
fDate
2/1/2001 12:00:00 AM
Firstpage
835
Lastpage
837
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;
fLanguage
English
Journal_Title
Information Theory, IEEE Transactions on
Publisher
ieee
ISSN
0018-9448
Type
jour
DOI
10.1109/18.910593
Filename
910593
Link To Document