Interleaving-tailored joint log-likelihood decoder is universally capacity-achieving
Statement
Let be the coalition size, let denote the number of colluders receiving symbol , let be the pirate output, and let be the bias parameter. Define the score function
Universal joint-decoder conjecture. The joint log-likelihood decoder against the interleaving attack, using this score function, works against arbitrary attacks and asymptotically achieves the joint capacity of the uninformed fingerprinting game. The claim concerns a universal decoder whose optimality against arbitrary attacks is not proved in the paper and is left as an open problem.
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.