On 2-parent-identifying set systems of block size 4
From MaRDI portal
Publication:2004967
DOI10.1007/S10623-020-00763-6zbMath1465.94132arXiv1908.03523OpenAlexW3026780343MaRDI QIDQ2004967
Publication date: 7 October 2020
Published in: Designs, Codes and Cryptography (Search for Journal in Brave)
Full work available at URL: https://arxiv.org/abs/1908.03523
Related Items (1)
Cites Work
- Unnamed Item
- Upper bounds for parent-identifying set systems
- Families of finite sets in which no set is covered by the union of two others
- On codes with the identifiable parent property
- Analysis of two tracing traitor schemes via coding theory
- Generalization of IPP codes and IPP set systems
- Traceability codes and their generalizations
- Degenerate Turán densities of sparse hypergraphs
- Solving a linear equation in a set of integers I
- Combinatorial Properties and Constructions of Traceability Schemes and Frameproof Codes
- Tracing traitors
- Collusion-secure fingerprinting for digital data
- Probabilistic Existence Results for Parent-Identifying Schemes
- Nonrandom binary superimposed codes
- Bounds on Traceability Schemes
- Parent-identifying codes
This page was built for publication: On 2-parent-identifying set systems of block size 4