The heuristic all-colluders-caught estimate for fingerprinting
Statement
Let users receive binary codewords of length , let be the colluder set of size , and let be the set of accused users under the decoder of Theorem 1. Let and replace the parameter in that theorem by
All-colluders-caught estimate. With probability at least , no innocent users are accused, and with probability at least , all colluders are caught, meaning contains . This is presented as a heuristic estimate for the code length needed to catch every colluder; the source does not establish it as a theorem, so its status remains open.
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.