Asymptotic fingerprinting capacity for non-binary alphabets

Details Asymptotic fingerprinting capacity for non-binary alphabets Asymptotic fingerprinting capacity for non-binary alphabets

2011-02-02

arxiv.org/abs/1102.0445v1

Computer Science

Cryptography and Security

Scientific paper

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.

Affiliated with

Also associated with

No associations

Rating

Asymptotic fingerprinting capacity for non-binary alphabets does not yet have a rating. At this time, there are no reviews or comments for this scientific paper.

If you have personal experience with Asymptotic fingerprinting capacity for non-binary alphabets, we encourage you to share that experience with our LandOfFree.com community. Your opinion is very important and Asymptotic fingerprinting capacity for non-binary alphabets will most certainly appreciate the feedback.

Rate now

Comments { 0 }

Profile ID: LFWR-SCP-O-81255