New bounds for frameproof codes

Chong Shangguan, Xin Wang, Gennian Ge, Ying Miao

Research output: Contribution to journalArticlepeer-review


Frameproof codes are used to fingerprint digital data. They can prevent copyrighted materials from unauthorized use. In this paper, we study upper and lower bounds for w-frameproof codes of length N over an alphabet of size q. The upper bound is based on a combinatorial approach and the lower bound is based on a probabilistic construction. Both bounds can improve one of the previous results when q is small compared with w , say cq≤ w for some constant c ≤ q. Furthermore, we pay special attention to binary frameproof codes. We show a binary w-frameproof code of length N cannot have more than N codewords if N < (w+1/2).

Original languageEnglish
Article number8017416
Pages (from-to)7247-7252
Number of pages6
JournalIEEE Transactions on Information Theory
Issue number11
StatePublished - Nov 2017
Externally publishedYes


  • Combinatorial counting
  • Expurgation method
  • Fingerprinting
  • Frameproof codes


Dive into the research topics of 'New bounds for frameproof codes'. Together they form a unique fingerprint.

Cite this