English
Related papers

Related papers: Probability of super-regular matrices and MDS code…

200 papers

Let $\xi$ be a non-constant real-valued random variable with finite support, and let $M_{n}(\xi)$ denote an $n\times n$ random matrix with entries that are independent copies of $\xi$. For $\xi$ which is not uniform on its support, we show…

Probability · Mathematics 2021-05-07 Vishesh Jain , Ashwin Sah , Mehtaab Sawhney

We introduce various quantities that can be defined for an arbitrary matroid, and show that certain conditions on these quantities imply that a matroid is not representable over $\mathbb{F}_q$ where $q$ is a prime power. Mostly, for a…

Combinatorics · Mathematics 2023-06-01 J. Sun , S. B. Damelin

Maximum-distance separable (MDS) convolutional codes are characterized by the property that their free distance reaches the generalized Singleton bound. In this paper, new criteria to construct MDS convolutional codes are presented.…

Information Theory · Computer Science 2023-05-26 Zita Abreu , Julia Lieb , Raquel Pinto , Joachim Rosenthal

We present families of quantum error-correcting codes which are optimal in the sense that the minimum distance is maximal. These maximum distance separable (MDS) codes are defined over q-dimensional quantum systems, where q is an arbitrary…

Quantum Physics · Physics 2023-11-27 Markus Grassl , Thomas Beth , Martin Roetteler

We introduce the class of partition-balanced families of codes, and show how to exploit their combinatorial invariants to obtain upper and lower bounds on the number of codes that have a prescribed property. In particular, we derive precise…

Information Theory · Computer Science 2018-12-13 Eimear Byrne , Alberto Ravagnani

We establish a new asymptotic formula for the number of polynomials of degree $n$ with $k$ prime factors over a finite field $\mathbb{F}_q$. The error term tends to $0$ uniformly in $n$ and in $q$, and $k$ can grow beyond $\log n$.…

Number Theory · Mathematics 2023-05-04 Dor Elboim , Ofir Gorodetsky

Let $C$ be a linear code of length $n$ and dimension $k$ over the finite field $\mathbb{F}_{q^m}$. The trace code $\mathrm{Tr}(C)$ is a linear code of the same length $n$ over the subfield $\mathbb{F}_q$. The obvious upper bound for the…

Information Theory · Computer Science 2023-09-06 Márton Erdélyi , Pál Hegedüs , Sándor Z. Kiss , Gábor P. Nagy

For nonnegative integers $q,n,d$, let $A_q(n,d)$ denote the maximum cardinality of a code of length $n$ over an alphabet $[q]$ with $q$ letters and with minimum distance at least $d$. We consider the following upper bound on $A_q(n,d)$. For…

Combinatorics · Mathematics 2018-08-07 Bart Litjens , Sven Polak , Alexander Schrijver

Let $M$ be a random matrix chosen according to Haar measure from the unitary group $\mathrm{U}(n,\mathbb{C})$. Diaconis and Shahshahani proved that the traces of $M,M^2,\ldots,M^k$ converge in distribution to independent normal variables as…

Group Theory · Mathematics 2024-10-15 Ofir Gorodetsky , Brad Rodgers

Let $X_1,..., X_N\in\R^n$ be independent centered random vectors with log-concave distribution and with the identity as covariance matrix. We show that with overwhelming probability at least $1 - 3 \exp(-c\sqrt{n}\r)$ one has $ \sup_{x\in…

Probability · Mathematics 2012-11-01 Radosław Adamczak , Alexander E. Litvak , Alain Pajor , Nicole Tomczak-Jaegermann

Let $A$ be an $n \times n$ random matrix with iid entries over a finite field of order $q$. Suppose that the entries do not take values in any additive coset of the field with probability greater than $1 - \alpha$ for some fixed $0 < \alpha…

Combinatorics · Mathematics 2013-07-24 Kenneth Maples

We present a simple solution to a question posed by Candes, Romberg and Tao on the uniform uncertainty principle for Bernoulli random matrices. More precisely, we show that a rectangular k*n random subgaussian matrix (with k < n) has the…

Statistics Theory · Mathematics 2007-06-13 Shahar Mendelson , Alain Pajor , Nicole Tomczak-Jaegermann

Motivated by the Koml\'os conjecture in combinatorial discrepancy, we study the discrepancy of random matrices with $m$ rows and $n$ independent columns drawn from a bounded lattice random variable. It is known that for $n$ tending to…

Combinatorics · Mathematics 2018-10-19 Cole Franks , Michael Saks

Let $A$ be drawn uniformly at random from the set of all $n\times n$ symmetric matrices with entries in $\{-1,1\}$. We show that \[ \mathbb{P}( \det(A) = 0 ) \leq e^{-cn},\] where $c>0$ is an absolute constant, thereby resolving a…

Probability · Mathematics 2021-06-09 Marcelo Campos , Matthew Jenssen , Marcus Michelen , Julian Sahasrabudhe

In [10], the existence of $\mathbb{F}_q$-linear MRD-codes of $\mathbb{F}_q^{6\times 6}$, with dimension $12$, minimum distance $5$ and left idealiser isomorphic to $\mathbb{F}_{q^6}$, defined by a trinomial of $\mathbb{F}_{q^6}[x]$, when…

Combinatorics · Mathematics 2019-12-17 Giuseppe Marino , Maria Montanucci , Ferdinando Zullo

Conditional on the extended Riemann hypothesis, we show that with high probability, the characteristic polynomial of a random symmetric $\{\pm 1\}$-matrix is irreducible. This addresses a question raised by Eberhard in recent work. The main…

Probability · Mathematics 2021-06-09 Asaf Ferber , Vishesh Jain , Ashwin Sah , Mehtaab Sawhney

Let $ \nu $ be a probability distribution over the linear semi-group $ \mathrm{End}(E) $ for $ E $ a finite dimensional vector space over a locally compact field. We assume that $ \nu $ is proximal, strongly irreducible and that $…

Probability · Mathematics 2025-02-14 Axel Péneau

Recently we considered a class of random 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…

Probability · Mathematics 2020-03-10 Chin Hei Chan , Maosheng Xiong

We consider a random symmetric matrix ${\bf X} = [X_{jk}]_{j,k=1}^n$ with upper triangular entries being independent random variables with mean zero and unit variance. Assuming that $\max_{jk} {\mathbb E} |X_{jk}|^{4+\delta} < \infty,…

Probability · Mathematics 2019-04-19 Friedrich Götze , Alexey Naumov , Alexander Tikhomirov

Given an $n \times n$ complex matrix $A$, let $$\mu_{A}(x,y):= \frac{1}{n} |\{1\le i \le n, \Re \lambda_i \le x, \Im \lambda_i \le y\}|$$ be the empirical spectral distribution (ESD) of its eigenvalues $\lambda_i \in \BBC, i=1, ... n$. We…

Probability · Mathematics 2009-04-24 Terence Tao , Van Vu , Manjunath Krishnapur