We present a new class of asymptotically good, linear error-correcting
codes. These codes can be both encoded and decoded in linear time. Th
ey can also be encoded by logarithmic-depth circuits of linear size an
d decoded by logarithmic depth circuits of size O(n log n). We present
both randomized and explicit constructions of these codes.