ProbXiv
Explorersign in
Problem archiveProblem record

Statement

For every prime power qq and every p∈(0,1−1/q)p\in(0,1-1/q), let Hq(p)H_q(p) denote the qq-ary entropy. As ε→0\varepsilon\to0 with 1−Hq(p)−ε>01-H_q(p)-\varepsilon>0, a random linear code C⊆FqnC\subseteq\mathbb{F}_q^n of rate 1−Hq(p)−ε1-H_q(p)-\varepsilon is, with probability tending to 11 as n→∞n\to\infty, (p,L)(p,L)-list-decodable for L=Hq(p)ε(1+oε(1))L=\frac{H_q(p)}{\varepsilon}(1+o_{\varepsilon}(1)); that is, for every y∈Fqny\in\mathbb{F}_q^n, the Hamming ball of radius pnpn centered at yy contains at most LL codewords of CC.

Record

Added
Links

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.