The asymptotic gap conjecture for PIR codes with block length k=2^s-2
Statement
Let denote the optimal block length of a PIR code with parameters and , and let denote the coding-theoretic lower bound. Set . Asymptotic gap conjecture.
This conjecture asserts that, for the parameter choice , the gap between the optimal PIR-code block length and the coding-theoretic lower bound grows without bound. The surrounding discussion identifies this as a case where optimal codes appear to have substantially larger length than the lower bound; no resolution is given here.
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.