Upper bounds for parent-identifying set systems
From MaRDI portal
Publication:1009142
DOI10.1007/S10623-008-9253-ZzbMATH Open1236.05050OpenAlexW2069023101MaRDI QIDQ1009142FDOQ1009142
Authors: Michael J. Collins 
Publication date: 31 March 2009
Published in: Designs, Codes and Cryptography (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1007/s10623-008-9253-z
Recommendations
- Upper Bounds for Set Systems with the Identifiable Parent Property
- Improved upper bounds for parent-identifying set systems and separable codes
- Constructive upper bounds for intersecting set systems
- On 2-parent-identifying set systems of block size 4
- On separating systems with bounded set size
- Extremal \(n\)-systems of sets
- Upper and lower bounds on \(B_k^{+}\)-sets
- Probabilistic Existence Results for Parent-Identifying Schemes
- Determination of set-membership identifiability sets
- An Upper Bound on the Size of Sidon Sets
Cites Work
- Combinatorial properties of frameproof and traceability codes
- Tracing traitors
- A Note About the Traceability Properties of Linear Codes
- Families of finite sets in which no set is covered by the union of \(r\) others
- Combinatorial Properties and Constructions of Traceability Schemes and Frameproof Codes
- An upper bound on the size of a code with the \(k\)-identifiable parent property
- New Bounds on Parent-Identifying Codes: The Case of Multiple Parents
- Upper Bounds for Set Systems with the Identifiable Parent Property
Cited In (12)
- Sparse hypergraphs with applications to coding theory
- Signature codes for weighted noisy adder channel, multimedia fingerprinting and compressed sensing
- New constructions for IPP codes
- An upper bound on the size of a code with the \(k\)-identifiable parent property
- Generalization of IPP codes and IPP set systems
- Traceability codes and their generalizations
- Probabilistic Existence Results for Parent-Identifying Schemes
- New upper bounds for parent-identifying codes and traceability codes
- On 2-parent-identifying set systems of block size 4
- Improved upper bounds for parent-identifying set systems and separable codes
- Union-intersection-bounded families and their applications
- On non-binary traceability set systems
This page was built for publication: Upper bounds for parent-identifying set systems
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q1009142)
