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...

Celý popis

Podrobná bibliografia

Vydané v:	IEEE transactions on information theory Ročník 42; číslo 6; s. 1710 - 1722
Hlavní autori:	Sipser, M., Spielman, D.A.
Médium:	Journal Article
Jazyk:	English
Vydavateľské údaje:	New York IEEE 01.11.1996 The Institute of Electrical and Electronics Engineers, Inc. (IEEE)
Predmet:	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
On-line prístup:	Získať plný text
Tagy:	Pridať tag Žiadne tagy, Buďte prvý, kto otaguje tento záznam!