On codes decoding a constant fraction of errors on the BSC
share
Using techniques and results from Kudekar et al. we strengthen the bounds on the weight distribution of linear codes achieving capacity on the BEC, which were shown by the first author. In particular, we show that for any doubly transitive binary linear code C ⊆{0,1}^n of rate 0 < R < 1 with weight distribution (a_0,...,a_n) holds a_i ≤ 2^o(n)· (1-R)^-2 ln 2 ·min{i, n-i}. For doubly transitive codes with minimal distance at least Ω(n^c), 0 < c ≤ 1, the error factor of 2^o(n) in this bound can be removed at the cost of replacing 1-R with a smaller constant a = a(R,c) < 1- R. Moreover, in the special case of Reed-Muller codes, due to the additional symmetries of these codes, this error factor can be removed at essentially no cost. This implies that for any doubly transitive code C of rate R with minimal distance at least Ω(n^c), there exists a positive constant p = p(R,c) such that C decodes errors on BSC(p) with high probability if p < p(R,c). For doubly transitive codes of a sufficiently low rate (smaller than some absolute constant) the requirement on the minimal distance can be omitted, and hence this critical probability p(R) depends only on R. Furthermore, p(R) →1/2 as R → 0. In particular, a Reed-Muller code C of rate R decodes errors on BSC(p) with high probability if R < 1 - (4p(1-p))^1/4 ln 2, answering a question of Abbe, Hazla, and Nachum.
READ FULL TEXT