Linear-time encodable and decodable error-correcting codes

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

• Type: Conference
• Year: 1995
• Where: STOC
• Authors: Daniel A. Spielman
• Keywords: Algorithms, Linear Error-correcting Codes, Linear Time, Logarithmic Depth Circuits, STOC 1995