Advertisement
Published in:
2009 | OriginalPaper | Chapter
Equal-Weight Fingerprinting Codes
Activate our intelligent search to find suitable subject content or patents.
Select sections of text to find matching patents with Artificial Intelligence. powered by
Select sections of text to find additional relevant content using AI-assisted search. powered by
We consider binary fingerprinting codes that trace at least one of
t
pirates using the marking assumption. Ensembles of binary equal-weight codes are considered along with a new efficient decoding algorithm. The design substantially increases the code rates of the former fingerprinting constructions. In particular, for large
t
, the new
t
-fingerprinting codes have code rate of
t
− 2
ln 2 and identify a pirate with an error probability that declines exponentially in code length
n
.