Spectral Distribution of Product of Pseudorandom Matrices Formed From Binary Block Codes

Let A ∈ {-1,1}^N_a ×n and B ∈ {-1,1}^N_b ×n be two matrices whose rows are drawn i.i.d. from the codewords of the binary codes C^a and C^b of length n and dual distances d^´a and d^´b, respectively, under the mapping 0 → 1 and 1 → -1. It is proven that as n → ∞ with y_a:=n/N_a ∈ (0,∞) and y_b:=n/N_b ∈ (0, ∞) fixed, the empirical spectral distribution of the matrix A B*/√{N_a N_b} resembles a universal distribution (closely related to the distribution function of the free multiplicative convolution of two members of the Marchenko-Pastur family of densities) in the sense of the Lévy distance, if the asymptotic dual distances of the underlying binary codes are large enough. Moreover, an explicit upper bound on the Lévy distance of the two distributions in terms of y_a, y_b, d^´a, and d^´b is given. Under mild conditions, the upper bound is strengthened to the Kolmogorov distance of the underlying distributions. Numerical studies on the empirical spectral distribution of the product of random matrices from BCH and Gold codes are provided, which verify the validity of this result.