TY - GEN
T1 - On fingerprinting capacity games for arbitrary alphabets and their asymptotics
AU - Huang, Yen Wei
AU - Moulin, Pierre
PY - 2012
Y1 - 2012
N2 - Fingerprinting capacity has recently been derived as the value of a two-person zero-sum game. In this work, we study fingerprinting capacity games with k pirates under the k combined digit model proposed by Škorić et al. For small k, capacities along with optimal strategies for both players of the game are obtained explicitly. For large k, we extend our earlier asymptotic analysis for the binary alphabet to this general model and show that capacity is asymptotic to A/k 2 where the constant A is identified. Saddle-point solutions to the functional maximin game are obtained using methods of variational calculus.
AB - Fingerprinting capacity has recently been derived as the value of a two-person zero-sum game. In this work, we study fingerprinting capacity games with k pirates under the k combined digit model proposed by Škorić et al. For small k, capacities along with optimal strategies for both players of the game are obtained explicitly. For large k, we extend our earlier asymptotic analysis for the binary alphabet to this general model and show that capacity is asymptotic to A/k 2 where the constant A is identified. Saddle-point solutions to the functional maximin game are obtained using methods of variational calculus.
UR - http://www.scopus.com/inward/record.url?scp=84867538846&partnerID=8YFLogxK
UR - http://www.scopus.com/inward/citedby.url?scp=84867538846&partnerID=8YFLogxK
U2 - 10.1109/ISIT.2012.6283982
DO - 10.1109/ISIT.2012.6283982
M3 - Conference contribution
AN - SCOPUS:84867538846
SN - 9781467325790
T3 - IEEE International Symposium on Information Theory - Proceedings
SP - 2571
EP - 2575
BT - 2012 IEEE International Symposium on Information Theory Proceedings, ISIT 2012
T2 - 2012 IEEE International Symposium on Information Theory, ISIT 2012
Y2 - 1 July 2012 through 6 July 2012
ER -