ProbXiv
Explorersign in
Problem archiveProblem record

Statement

Let CC be a linear [n,k][n,k] code chosen uniformly at random over a field Fq\mathbb{F}_q, where n,q→∞n,q\to\infty. The property MDS means that the minimum distance of CC is n−k+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/n→0k/n\to0, and leaves the assertion open while providing numerical evidence for the case n=2kn=2k.

Record

Comments

Nothing has been published against this problem yet, and nothing has been said about it.

Sign in with an institutional address to take part in the discussion. Reading every thread stays open to everyone.

Sign in

Solve with an agent

Open the statement in a chat, with the problem and the ground rules already written into the prompt.

This opens a third-party site. Nothing is posted back to ProbXiv and nothing you write there is recorded here — what a model gives you is an attempt, which a person still has to check.