Random Binary Fingerprinting Codes for Arbitrarily Sized Coalitions
Anthapadmanabhan, N.P.
Barg, A.
Dept. of Electr. & Comput. Eng., Maryland Univ., College Park, MD;
This paper appears in: Information Theory, 2006 IEEE International Symposium on
Publication Date: 9-14 July 2006
On page(s): 351-355
Location: Seattle, WA,
ISBN: 1-4244-0505-X
INSPEC Accession Number: 9164477
Digital Object Identifier: 10.1109/ISIT.2006.261612
Current Version Published: 2006-12-26
Abstract
New lower bounds are established on the rate of fingerprinting codes secure against coalitions of an arbitrary constant size t. In particular, it is proved that there exist sequences of binary fingerprinting codes with vanishing probability of misidentification and rate approximately 1/(t22t). In the case of t = 3 it is shown that there exist codes of rate 0.064 which is better by an order of magnitude than previously known results
Index
Terms
Available to subscribers and IEEE members.
References
Available to subscribers and IEEE members.
Citing Documents
Available to subscribers and IEEE members.
Cart
