On 2-parent-identifying set systems of block size 4
From MaRDI portal
Abstract: Parent-identifying set system is a kind of combinatorial structures with applications to broadcast encryption. In this paper we investigate the maximum number of blocks in a -parent-identifying set system with ground set size and block size . The previous best known lower bound states that . We improve this lower bound by showing that using techniques in additive number theory.
Recommendations
Cites work
- Analysis of two tracing traitor schemes via coding theory
- Bounds on Traceability Schemes
- Collusion-secure fingerprinting for digital data
- Combinatorial Properties and Constructions of Traceability Schemes and Frameproof Codes
- Degenerate Turán densities of sparse hypergraphs
- Families of finite sets in which no set is covered by the union of two others
- Generalization of IPP codes and IPP set systems
- scientific article; zbMATH DE number 1406785 (Why is no real title available?)
- Nonrandom binary superimposed codes
- On codes with the identifiable parent property
- Parent-identifying codes
- Probabilistic Existence Results for Parent-Identifying Schemes
- Solving a linear equation in a set of integers I
- Traceability codes and their generalizations
- Tracing traitors
- Upper bounds for parent-identifying set systems
Cited in
(2)
This page was built for publication: On 2-parent-identifying set systems of block size 4
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2004967)