Related papers: Random Matrices from Linear Codes and Wigner's Sem…
Given a universal gate set on two qubits, it is well known that applying random gates from the set to random pairs of qubits will eventually yield an approximately Haar-distributed unitary. However, this requires exponential time. We show…
We explore the validity of the circular law for random matrices with non i.i.d. entries. Let A be a random n \times n real matrix having as a random vector in R^{n^2} a log-concave isotropic unconditional law. In particular, the entries are…
We discuss the limiting spectral density of real symmetric random matrices. Other than in standard random matrix theory the upper diagonal entries are not assumed to be independent, but we will fill them with the entries of a stochastic…
We study the limiting spectral measure of large random Helson matrices and large random matrices of certain patterned structures. Given a real random variable $X \in L^{2+ \varepsilon}(\mathbb{P}) $ for some $\varepsilon > 0$ and…
In this paper, we consider the Reed-Muller (RM) codes. For the first order RM code, we prove that it is unique in the sense that any linear code with the same length, dimension and minimum distance must be the first order RM code; For the…
Random matrix theory (RMT) successfully predicts universal statistical properties of complicated wave scattering systems in the semiclassical limit, while the random coupling model offers a complete statistical model with a simple additive…
Given a real matrix A with n columns, the problem is to approximate the Gram product AA^T by c << n weighted outer products of columns of A. Necessary and sufficient conditions for the exact computation of AA^T (in exact arithmetic) from c…
Wideband communication receivers often deal with the problems of detecting weak signals from distant sources received together with strong nearby interferers. When the techniques of random modulation are used in communication system…
In this article, we establish a near-optimal convergence rate for the CLT of linear eigenvalue statistics of Wigner matrices, in Kolmogorov-Smirnov distance. For all test functions $f\in C^5(\mathbb R)$, we show that the convergence rate is…
Delsarte's method and its extensions allow to consider the upper bound problem for codes in 2-point-homogeneous spaces as a linear programming problem with perhaps infinitely many variables, which are the distance distribution. We show that…
The construction of self-dual codes over small fields such that their minimum distances are as large as possible is a long-standing challenging problem in the coding theory. In 2009, a family of binary self-dual cyclic codes with lengths…
An M-sequence generated by a primitive polynomial has many interesting and desirable properties. A pseudo-random array is the two-dimensional generalization of an M-sequence. There are non-primitive polynomials all of whose non-zero…
We show that rational data of bounded input length are uniformly distributed with respect to condition numbers of numerical analysis. We deal both with condition numbers of Linear Algebra and with condition numbers for systems of…
Random matrix ensembles with orthogonal and unitary symmetry correspond to the cases of real symmetric and Hermitian random matrices respectively. We show that the probability density function for the corresponding spacings between…
We introduce a random coding technique for transmission over discrete memoryless channels, reminiscent of the basic construction attaining the Gilbert-Varshamov bound for codes in Hamming spaces. The code construction is based on drawing…
This paper addresses the issue of design of low-rate sparse-graph codes with linear minimum distance in the blocklength. First, we define a necessary condition which needs to be satisfied when the linear minimum distance is to be ensured.…
Block Toeplitz and Hankel matrices arise in many aspects of applications. In this paper, we will research the distributions of eigenvalues for some models and get the semicircle law. Firstly we will give trace formulae of block Toeplitz and…
Let F ($\nu$) be the centered Gamma law with parameter $\nu$ > 0 and let us denote by P Y the probability distribution of a random vector Y. We develop a multidimensional variant of the Stein's method for Gamma approximation that allows to…
We consider the local eigenvalue distribution of large self-adjoint $N\times N$ random matrices $\mathbf{H}=\mathbf{H}^*$ with centered independent entries. In contrast to previous works the matrix of variances $s_{ij} = \mathbb{E}\,…
It is known that the joint limit distribution of independent Wigner matrices satisfies a very special asymptotic independence, called freeness. We study the joint convergence of a few other patterned matrices, providing a framework to…