An asymmetric packing code of radius R is a set of binary n-words so that no binary n-word can be reached from more than
Statement
/Ellis/Kahng: An asymmetric packing code of radius R is a set of binary n-words so that no binary n-word can be reached from more than one of the codewords by changing at most R zeroes to ones. How big is the largest asymmetric covering code of radius R with n bits?
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.