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(nlogn). We present both randomized and explicit constructions of these codes.
No takes yet. Share an insight, caveat, or question.
Daniel A. Spielman (1996) studied this question.
Synapse has enriched 5 closely related papers on similar clinical questions. Consider them for comparative context: