ProbXiv
Explorersign in
Problem archiveProblem record

Statement

For a code of rate RR over a finite field, list-decodable from relative radius rr with list size LL means that every Hamming ball of radius rnr n contains at most LL codewords. List-size conjecture beyond the Johnson radius. For any R,ϵ>0R,\epsilon>0, there exist Reed–Solomon codes with rate RR over a sufficiently large finite field that are list-decodable from radius 1−R−ϵ1-R-\epsilon with list size at most 1−R−ϵϵ\frac{1-R-\epsilon}{\epsilon}. This gives an explicit target for the list size as the decoding radius approaches the rate-one capacity threshold; the source presents it as implied by the preceding conjecture and does not report a proof or disproof.

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.