Separation and Witnesses
From MaRDI portal
Publication:5322994
DOI10.1007/978-3-642-01877-0_2zbMath1248.94046OpenAlexW2118696470MaRDI QIDQ5322994
Publication date: 23 July 2009
Published in: Lecture Notes in Computer Science (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1007/978-3-642-01877-0_2
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- A Boolean measure of similarity
- New bounds for perfect hashing via information theory
- On codes with the identifiable parent property
- Separating systems
- Generalized hashing and parent-identifying codes.
- On the extremal combinatorics of the Hamming space
- Witness sets for families of binary vectors
- Induced subsets
- A Hypergraph Approach to the Identifying Parent Property: The Case of Multiple Parents
- On the Size of Separating Systems and Families of Perfect Hash Functions
- Separating Partition Systems and Locally Different Sequences
- Modular curves and codes with a polynomial construction
- Witness Sets
- Upper Bounds on Separating Codes
- Modular curves, Shimura curves, and Goppa codes, better than Varshamov-Gilbert bound
- Fredman–Komlós bounds and information theory
- Perfect Hashing and Probability
- Combinatorial Properties and Constructions of Traceability Schemes and Frameproof Codes
- Combinatorial properties of frameproof and traceability codes
- Asymptotic bounds on frameproof codes
- Collusion-secure fingerprinting for digital data
- Intersecting codes and independent families
- Parent-identifying codes
