Author :
Sipser, Michael ; Spielman, Daniel A.
Author_Institution :
Dept. of Math., MIT, Cambridge, MA, USA
Abstract :
We present a new class of asymptotically good, linear error-correcting codes based upon expander graphs. These codes have linear time sequential decoding algorithms, logarithmic time parallel decoding algorithms with a linear number of processors, and are simple to understand. We present both randomized and explicit constructions for some of these codes. Experimental results demonstrate the extremely good performance of the randomly chosen codes
Keywords :
encoding; error correction codes; sequential decoding; expander codes; expander graphs; linear error-correcting codes; linear time sequential decoding algorithms; logarithmic time parallel decoding algorithms; CD recording; Contracts; Decoding; Ear; Encoding; Error correction codes; Graph theory; Laboratories; Mathematics; Satellites;
Conference_Titel :
Foundations of Computer Science, 1994 Proceedings., 35th Annual Symposium on
Conference_Location :
Santa Fe, NM
Print_ISBN :
0-8186-6580-7
DOI :
10.1109/SFCS.1994.365734
