Constructions and bounds for (m,t)-splitting systems
From MaRDI portal
Recommendations
Cites work
- scientific article; zbMATH DE number 3843786 (Why is no real title available?)
- scientific article; zbMATH DE number 5139441 (Why is no real title available?)
- scientific article; zbMATH DE number 867473 (Why is no real title available?)
- An exact result for 3-graphs
- Chromatic Turán problems and a new upper bound for the Turán density of \(\mathcal K^-_4\)
- Combinatorial properties of systems of sets
- Families of finite sets in which no set is covered by the union of two others
- Intersection statements for systems of sets
- On hypergraphs with every four points spanning at most two triples
- Some baby-step giant-step algorithms for the low Hamming weight discrete logarithm problem
- Splitting systems and separating systems.
Cited in
(8)- Constructions and bounds for splitting and separating systems.
- scientific article; zbMATH DE number 3983505 (Why is no real title available?)
- On the low Hamming weight discrete logarithm problem for nonadjacent representations
- On splitting and splittable families
- On generalizations of separating and splitting families
- \((m,3)\)-splitting systems
- Splitting systems and separating systems.
- Constructions for uniform \((m,3)\)-splitting systems
This page was built for publication: Constructions and bounds for \((m,t)\)-splitting systems
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q861791)