Abstract
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 -∈2ln 2 and identify a pirate with an error probability that declines exponentially in code length n. © 2009 Springer Berlin Heidelberg.
Cite
CITATION STYLE
Dumer, I. (2009). Equal-weight fingerprinting codes. In Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics) (Vol. 5557 LNCS, pp. 43–51). https://doi.org/10.1007/978-3-642-01877-0_5
Register to see more suggestions
Mendeley helps you to discover research relevant for your work.
