Affordable Access

Asymptotic fingerprinting capacity for non-binary alphabets

Authors
  • Boesten, Dion
  • Skoric, Boris
Type
Preprint
Publication Date
Feb 02, 2011
Submission Date
Feb 02, 2011
Identifiers
arXiv ID: 1102.0445
Source
arXiv
License
Yellow
External links

Abstract

We compute the channel capacity of non-binary fingerprinting under the Marking Assumption, in the limit of large coalition size c. The solution for the binary case was found by Huang and Moulin. They showed that asymptotically, the capacity is $1/(c^2 2\ln 2)$, the interleaving attack is optimal and the arcsine distribution is the optimal bias distribution. In this paper we prove that the asymptotic capacity for general alphabet size q is $(q-1)/(c^2 2\ln q)$. Our proof technique does not reveal the optimal attack or bias distribution. The fact that the capacity is an increasing function of q shows that there is a real gain in going to non-binary alphabets.

Report this publication

Statistics

Seen <100 times