We conclude with several open problems: (1) Beyond coordinate-wise constraints.
Statement
We conclude with several open problems: (1) Beyond coordinate-wise constraints. Is it true that, for a random linear code, with high probability every such ball contains at most q ǫn \cdot (1 + o(1)) codewords? The report passage is retained verbatim as the relevant context for this extracted problem.
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.