On expander codes
Zemor, G.
Ecole Nat. Superieure des Telecommun., Paris;
This paper appears in: Information Theory, IEEE Transactions on
Publication Date: Feb 2001
Volume: 47,
Issue: 2
On page(s): 835-837
ISSN: 0018-9448
References Cited: 6
CODEN: IETTAW
INSPEC Accession Number: 6883293
Digital Object Identifier: 10.1109/18.910593
Current Version Published: 2002-08-07
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
Index
Terms
Available to subscribers and IEEE members.
References
Available to subscribers and IEEE members.
Citing Documents
Available to subscribers and IEEE members.
Cart
