Generalized covering-code rate problem
Statement
Let be an alphabet of size , let be fixed, and let . For , define the column Hamming distance by , and define the -th covering radius of by . Let be the infimum of over sequences satisfying . Determine whether where . When is a prime power, determine whether the same formula holds when every is required to be a linear code over .
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.