Random Matrices from Linear Codes and Wigner’s Semicircle Law II

Recently we considered a new normalization of matrices obtained by choosing distinct codewords at random from linear codes over finite fields and proved that under some natural algebraic conditions their empirical spectral distribution converges to Wigner’s semicircle law as the length of the codes goes to infinity. One of the conditions is that the dual distance of the codes is at least 5. In this report, by employing more advanced techniques related to Stieltjes transform, we show that the dual distance being at least 5 is sufficient to ensure the convergence. We also obtain a fast convergence rate in terms of the length of the code.