Year: 2025
Type: preprint
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 {\it 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 Erdős matching number in our proof and derive relevant estimates for it.
Source: arXiv (Cornell University)
Authors: Zhong, Wenjie, Huang, Xinqi, Zhang, Xiande
Subfield: Discrete Mathematics and Combinatorics
Field: Mathematics
Domain: Physical Sciences
Open Access status: green
OpenAlex ID: W7106748100
Cites:
Cited by:
Related to: