Convergence Rate of Empirical Spectral Distribution of Random Matrices from Linear Codes

by   Chin Hei Chan, et al.
Duke University
The Hong Kong University of Science and Technology

It is known that the empirical spectral distribution of random matrices obtained from linear codes of increasing length converges to the well-known Marchenko-Pastur law, if the Hamming distance of the dual codes is at least 5. In this paper, we prove that the convergence in probability is at least in the order of n^-1/4 where n is the length of the code.


page 1

page 2

page 3

page 4


Random Matrices from Linear Codes and Wigner's semicircle law

In this paper we consider a new normalization of matrices obtained by ch...

Distribution of the minimal distance of random linear codes

We study the distribution of the minimal distance (in the Hamming metric...

Linear convergence of the Collatz method for computing the Perron eigenpair of primitive dual number matrix

Very recently, Qi and Cui extended the Perron-Frobenius theory to dual n...

Hadamard matrices related to a certain series of ternary self-dual codes

In 2013, Nebe and Villar gave a series of ternary self-dual codes of len...

On components of a Kerdock code and the dual of the BCH code C_1,3

In the paper we investigate the structure of i-components of two classes...

Evolutionary Strategies for the Design of Binary Linear Codes

The design of binary error-correcting codes is a challenging optimizatio...

Please sign up or login with your details

Forgot password? Click here to reset