List-size conjecture for Reed–Solomon codes beyond the Johnson radius
Statement
For a code of rate over a finite field, list-decodable from relative radius with list size means that every Hamming ball of radius contains at most codewords. List-size conjecture beyond the Johnson radius. For any , there exist Reed–Solomon codes with rate over a sufficiently large finite field that are list-decodable from radius with list size at most . 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 inSolve with an agent
Open the statement in a chat, with the problem and the ground rules already written into the prompt.