Splitting systems and separating systems.
From MaRDI portal
Recommendations
Cites work
- scientific article; zbMATH DE number 3161569 (Why is no real title available?)
- scientific article; zbMATH DE number 3577144 (Why is no real title available?)
- On the Size of Separating Systems and Families of Perfect Hash Functions
- Secure frameproof codes, key distribution patterns, group testing algorithms and related structures
- Some baby-step giant-step algorithms for the low Hamming weight discrete logarithm problem
Cited in
(10)- Constructions and bounds for splitting and separating systems.
- Learning how to separate.
- On the low Hamming weight discrete logarithm problem for nonadjacent representations
- Separating systems of conjunctions.
- On splitting and splittable families
- On generalizations of separating and splitting families
- \((m,3)\)-splitting systems
- Constructions and bounds for \((m,t)\)-splitting systems
- Constructions for uniform \((m,3)\)-splitting systems
- Separating Partition Systems and Locally Different Sequences
This page was built for publication: Splitting systems and separating systems.
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q1428538)