ProbXiv
Explorersign in
Problem archiveProblem record

Statement

Let nn users receive binary codewords of length ℓ\ell, let C\mathcal{C} be the colluder set of size cc, and let C′\mathcal{C}' be the set of accused users under the decoder of Theorem 1. Let ε1,ε2>0\varepsilon_1,\varepsilon_2>0 and replace the parameter γ\gamma in that theorem by

γ′=ln⁡(c/ε2)ln⁡(n/ε1).\gamma' = \frac{\ln(c/\varepsilon_2)}{\ln(n/\varepsilon_1)}.

All-colluders-caught estimate. With probability at least 1−ε11-\varepsilon_1, no innocent users are accused, and with probability at least 1−ε21-\varepsilon_2, all colluders are caught, meaning C′\mathcal{C}' contains C\mathcal{C}. 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 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.