Asymptotic binary fingerprinting capacity for multiple TV channels
Statement
Let be the coalition size, let be the number of parallel TV channels, and let denote the binary fingerprinting capacity in this setting. Assume . Multiple-channel capacity conjecture. The capacity satisfies
with optimal strategies , , and
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 .
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.