4 problems

Consider the joint informed and uninformed fingerprinting games and the corresponding log-likelihood score functions for joint decoding. A suitable accusation algorithm must assign…

Universal joint-decoder conjecture. The joint log-likelihood decoder against the interleaving attack, using this score function, works against arbitrary attacks and asymptotically…

Let the joint decoder be tailored against the interleaving attack, and let the joint uninformed capacity denote the optimal asymptotic rate in the uninformed fingerprinting game. I…

Asymptotic optimality conjecture. When $k \rightarrow \infty$, we have