Quantitative Frameproof Codes and Hypergraphs
Abstract
Frameproof codes are a class of secure codes introduced by Boneh and Shaw in the context of digital fingerprinting, and have been widely studied from a combinatorial point of view. In this paper, we study a quantitative extension of frameproof codes and hypergraphs, referred to as quantitative frameproof codes and hypergraphs. We give asymptotically optimal bounds on the maximum sizes of these structures and determine their exact sizes for a broad range of parameters. In particular, we introduce a generalized version of the Erdos matching number in our proof and derive relevant estimates for it.
Turn this paper into a full lesson
ArcXiv compiles a staged curriculum from this paper: 8-12 lessons across beginner → advanced, synthesised section guides, visuals, flashcards, a quiz, exercises, and on-demand deep dives per section. Grounded in the abstract, never invented.