A covering code of radius R is a set of binary n-words so that every binary n-word can be reached from one of the codewo
Statement
A covering code of radius R is a set of binary n-words so that every binary n-word can be reached from one of the codewords by changing at most R bits. How big is the smallest covering code of radius R with n bits? It is known to be a constant c(R) times 2^(R )/ n^(R), but it's not known what c(R) is. Some believe that c(R) = R!.
Record
- Source
- 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.