A copy of this work was available on the public web and has been preserved in the Wayback Machine. The capture dates from 2018; you can also visit the original URL.
The file type is
It is widely known that decoding problems for random linear codes are computationally hard in general. Surprisingly, Kopparty and Saraf proved query-efficient list-decodability of sparse random linear codes by showing a reduction from a decoding problem for sparse random linear codes to that for the Hadamard code with small number of queries even under high error rate  . In this paper, we show a more direct list-decoding algorithm for sparse random linear codes with small number of queriesdoi:10.1587/transinf.2014fcp0016 fatcat:u6ztnljvirfq3bceyldl67whiy