The MDS probability convergence conjecture

Let CC be a linear [n,k][n,k] code chosen uniformly at random over a field Fq\mathbb{F}_q, where n,qn,q\to\infty. The property MDS means that the minimum distance of CC is nk+1n-k+1.

MDS probability convergence conjecture. If

1q(nk)λ(0,),\frac{1}{q}\binom{n}{k}\to\lambda\in(0,\infty),

then

P(C is MDS)eλ.P(C\text{ is MDS})\to e^{-\lambda}.

The source notes that this extends the known asymptotic result beyond the regime k/n0k/n\to0, and leaves the assertion open while providing numerical evidence for the case n=2kn=2k.

Sources & referencesView supporting material

Primary source

Rathinakumar Appuswamy, Marco Bazzani, Spencer Congero, Joseph Connelly, Matthew Ekaireb and Kenneth Zeger, “Probability of super-regular matrices and MDS codes over finite fields”, arXiv:2603.20983 (2026).

Progress summary

Never refreshed

Nothing recorded yet. Refresh searches the literature and the public web for attempts on this problem, and writes the first summary here.

Solutions 0

No solutions have been posted yet.