7 problems

Let $k$ be the coalition size, let $L$ be the number of parallel TV channels, and let $C_{\rm fp}^{\rm binary}(k,L)$ denote the binary fingerprinting capacity in this setting. Assu…

Let $L$ be the number of TV channels, let $k$ be the coalition size, and let $\tilde{L}=1$. Write $J_{k,L}$ for the original payoff and define the alternative payoff … Here…

In universal decoding for fingerprinting, let $c$ be the unknown coalition size, let $i_0$ denote the segment index, and let $\tau$ be an accusation boundary. A single score is mai…

All-colluders-caught estimate. With probability at least $1-\varepsilon_1$, no innocent users are accused, and with probability at least $1-\varepsilon_2$, all colluders are caught…

Conditional decoupling conjecture. The maximum is achieved by a probability mass function that decouples the components $(X_k,U_k)$, $k\in\mathcal{K}$, conditioned on $(S,W)$.

Feedback conjecture. Feedback can increase public fingerprinting capacity.

Non-tightness conjecture. The upper bound $\overline{C}^{all}(D_1,\mathscr{W}_K)$ is generally not tight.