Chen–Zhang's optimal list-recovery conjecture for folded Reed–Solomon codes
Statement
Let denote the list-recovery agreement parameter, and let be defined by
For constants , , with , , and a generator of , there is a constant such that, whenever , , and is sufficiently large, every rate- folded Reed–Solomon code
with appropriate evaluation points in is list-recoverable.
Chen–Zhang's conjecture. For the stated parameters, folded Reed–Solomon codes achieve list-recovery radius arbitrarily close to with input list size and output list size . The conjecture predicts the optimal tradeoff for these structured codes; its status is not resolved in the supplied source.
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.