Constructions and bounds for (m,t)-splitting systems
From MaRDI portal
Publication:861791
DOI10.1016/J.DISC.2006.04.042zbMATH Open1129.05052OpenAlexW1965839285MaRDI QIDQ861791FDOQ861791
Authors: G. H. J. van Rees, Dameng Deng, D. R. Stinson, P. C. Li, Ruizhong Wei 
Publication date: 2 February 2007
Published in: Discrete Mathematics (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1016/j.disc.2006.04.042
Recommendations
Cites Work
- Families of finite sets in which no set is covered by the union of two others
- Title not available (Why is that?)
- Title not available (Why is that?)
- An exact result for 3-graphs
- Splitting systems and separating systems.
- Some baby-step giant-step algorithms for the low Hamming weight discrete logarithm problem
- Combinatorial properties of systems of sets
- Intersection statements for systems of sets
- On hypergraphs with every four points spanning at most two triples
- Title not available (Why is that?)
- Chromatic Turán problems and a new upper bound for the Turán density of \(\mathcal K^-_4\)
Cited In (8)
- Constructions and bounds for splitting and separating systems.
- Title not available (Why is that?)
- 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)
