ProbXiv
Explorersign in
Problem archiveProblem record

Statement

Let kk be the coalition size, let LL be the number of parallel TV channels, and let Cfpbinary(k,L)C_{\rm fp}^{\rm binary}(k,L) denote the binary fingerprinting capacity in this setting. Assume L~=1\tilde{L}=1. Multiple-channel capacity conjecture. The capacity satisfies

max⁡fWmin⁡{π},pC^Cfpbinary(k,L)⟶L2k22ln⁡2,\max_{f_W}\min_{\{\pi\},p_{\hat C}}C_{\rm fp}^{\rm binary}(k,L)\longrightarrow\frac{L^2}{k^2 2\ln 2},

with optimal strategies fW∗(w)=(πw(1−w))−1f_W^*(w)=(\pi\sqrt{w(1-w)})^{-1}, g∗(w)=wg^*(w)=w, and

pC^∗(c^)=∏l=1Lδ(cl,k/L).p_{\hat C}^*(\hat c)=\prod_{l=1}^{L}\delta(c^l,k/L).

This conjecture extends the single-TV-channel fingerprinting-capacity asymptotic to parallel channels. The source motivates it by reducing the problem, after conditioning on the channel assignment, to independent single-channel problems, but gives no proof for general LL.

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 in

Solve with an agent

Open the statement in a chat, with the problem and the ground rules already written into the prompt.

This opens a third-party site. Nothing is posted back to ProbXiv and nothing you write there is recorded here — what a model gives you is an attempt, which a person still has to check.