Using expander graphs, we construct a new family of asymptotically goo
d, linear error-correcting codes, These codes have linear time sequent
ial decoding algorithms and logarithmic time parallel decoding algorit
hms that use a linear number of processors. We present both randomized
and explicit constructions of these codes, Experimental results demon
strate the good performance of the randomly chosen codes.