Good digital fingerprinting codes

A. Barg, G. R. Blakley, G. Kabatiansky

Research output: Contribution to journalArticlepeer-review

4 Citations (Scopus)


We construct binary t-secure fingerprinting codes (t = const) of size M = exp(cn), where n is the length of the fingerprint, for which the dealer (decoder) can recover at least one of the users from the colluding coalition with probability 1 - exp(-f(c)n). For the case t = 2 we construct codes with the property that the dealer can either recover both users of the coalition with probability 1 - exp((const)n), or identifies one of them with probability 1.

Original languageEnglish
Pages (from-to)161
Number of pages1
JournalIEEE International Symposium on Information Theory - Proceedings
Publication statusPublished - 2001
Externally publishedYes


Dive into the research topics of 'Good digital fingerprinting codes'. Together they form a unique fingerprint.

Cite this