Cites work
- A Boolean measure of similarity
- A hypergraph approach to the identifying parent property: The case of multiple parents
- Asymptotic bounds on frameproof codes
- Collusion-secure fingerprinting for digital data
- Combinatorial Properties and Constructions of Traceability Schemes and Frameproof Codes
- Combinatorial properties of frameproof and traceability codes
- Fredman–Komlós bounds and information theory
- Generalized hashing and parent-identifying codes.
- scientific article; zbMATH DE number 5542185 (Why is no real title available?)
- scientific article; zbMATH DE number 3577144 (Why is no real title available?)
- scientific article; zbMATH DE number 1324671 (Why is no real title available?)
- scientific article; zbMATH DE number 1406785 (Why is no real title available?)
- scientific article; zbMATH DE number 1418304 (Why is no real title available?)
- scientific article; zbMATH DE number 1418320 (Why is no real title available?)
- Induced subsets
- Intersecting codes and independent families
- Modular curves and codes with a polynomial construction
- Modular curves, Shimura curves, and Goppa codes, better than Varshamov-Gilbert bound
- New bounds for perfect hashing via information theory
- On codes with the identifiable parent property
- On the extremal combinatorics of the Hamming space
- On the Size of Separating Systems and Families of Perfect Hash Functions
- Parent-identifying codes
- Perfect Hashing and Probability
- Separating Partition Systems and Locally Different Sequences
- Separating systems
- The probabilistic method. With an appendix on the life and work of Paul Erdős.
- Upper Bounds on Separating Codes
- Witness Sets
- Witness sets for families of binary vectors
This page was built for publication: Separation and Witnesses
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q5322994)
