Answers are grounded in this paper and cite their sources.
Using expander graphs, we construct a new family of asymptotically good, linear error-correcting codes. These codes have linear time sequential decoding algorithms and logarithmic time parallel decoding algorithms that use a linear number of processors. We present both randomized and explicit constructions of these codes. Experimental results demonstrate the good performance of the randomly chosen codes.
No takes yet. Share an insight, caveat, or question.
Sipser et al. (1996) studied this question.
Synapse has enriched 10 related papers. Consider them for comparative context: