Fingerprinting Capacity Under the Marking Assumption
Anthapadmanabhan, N. Prasanth
Barg, Alexander
Dumer, Ilya
Dept. of Electrical and Computer Eng., University of Maryland, College Park, MD 20742. Email: nagarajp@umd.edu;
This paper appears in: Information Theory, 2007. ISIT 2007. IEEE International Symposium on
Publication Date: 24-29 June 2007
On page(s): 706-710
Location: Nice,
ISBN: 978-1-4244-1397-3
Digital Object Identifier: 10.1109/ISIT.2007.4557307
Current Version Published: 2008-07-09
Abstract
We study the maximum attainable rate or capacity of fingerprinting codes under the marking assumption. It is proved that capacity for fingerprinting against coalitions of size two and three over the binary alphabet satisfies 0.25 ¿ C2,2 ¿ 0.322 and 0.083 ¿ C3,2 ¿ 0.199 respectively. For coalitions of an arbitrary fixed size, we derive a closed-form upper bound on fingerprinting capacity in the binary case. Finally, for general alphabets, we establish upper bounds on the fingerprinting capacity involving only single-letter mutual information quantities.
Index
Terms
Available to subscribers and IEEE members.
References
Available to subscribers and IEEE members.
Citing Documents
Available to subscribers and IEEE members.
Cart
