On the List-Decodability of Random Linear Codes

The list-decodability of random linear codes is shown to be as good as that of general random codes. Specifically, for every fixed finite field Fq, p ∈ (0,1 - 1/q) and e >; 0, it is proved that with high probability a random linear code C in Fqn of rate (1-Hq(p)-e) can be list decoded from a fraction p of errors with lists of size at most O(1/e). This also answers a basic open question concerning the existence of highly list-decodable linear codes, showing that a list-size of O(1/e) suffices to have rate within e of the information-theoretically optimal rate of 1 - Hq(p). The best previously known list-size bound was qO(1/e) (except in the q = 2 case where a list-size bound of O(1/e) was known). The main technical ingredient in the proof is a strong upper bound on the probability that I random vectors chosen from a Hamming ball centered at the origin have too many (more than Ω(l)) vectors from their linear span also belong to the ball.