Quantitative Frameproof Codes and Hypergraphs
Fuente:
arXiv
Guardado en:
| Autores principales: | , , |
|---|---|
| Formato: | Preprint |
| Publicado: |
2025
|
| Materias: | |
| Acceso en línea: | |
| Etiquetas: |
Agregar Etiqueta
Sin Etiquetas, Sea el primero en etiquetar este registro!
|
| _version_ | 1866911280526262272 |
|---|---|
| author | Zhong, Wenjie Huang, Xinqi Zhang, Xiande |
| author_facet | Zhong, Wenjie Huang, Xinqi Zhang, Xiande |
| contents | 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. |
| format | Preprint |
| id |
arxiv_https___arxiv_org_abs_2511_17912 |
| institution | arXiv |
| publishDate | 2025 |
| record_format | arxiv |
| spellingShingle | Quantitative Frameproof Codes and Hypergraphs Zhong, Wenjie Huang, Xinqi Zhang, Xiande Combinatorics 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. |
| title | Quantitative Frameproof Codes and Hypergraphs |
| topic | Combinatorics |
| url | https://arxiv.org/abs/2511.17912 |