Asymptotically optimal list size of random linear codes
Statement
For every prime power and every , let denote the -ary entropy. As with , a random linear code of rate is, with probability tending to as , -list-decodable for ; that is, for every , the Hamming ball of radius centered at contains at most codewords of .
Record
- Added
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.