Expander codes

Using expander graphs, we construct a new family of asymptotically good, linear error-correcting codes. These codes have linear time sequential decoding algorithms and logarithmic time parallel decoding algorithms that use a linear number of processors. We present both randomized and explicit constr...

Full description

Bibliographic Details

Published in:	IEEE transactions on information theory Vol. 42; no. 6; pp. 1710 - 1722
Main Authors:	Sipser, M., Spielman, D.A.
Format:	Journal Article
Language:	English
Published:	New York IEEE 01.11.1996 The Institute of Electrical and Electronics Engineers, Inc. (IEEE)
Subjects:	Algorithm design and analysis Algorithms Bipartite graph Circuits Codes Computational modeling Decoding Error correction codes Fault tolerance Graph theory Information technology Linear code Parity check codes
ISSN:	0018-9448, 1557-9654
Online Access:	Get full text
Tags:	Add Tag No Tags, Be the first to tag this record!