Constructions and bounds for \((m,t)\)-splitting systems

DOI10.1016/J.DISC.2006.04.042zbMath1129.05052OpenAlexW1965839285MaRDI QIDQ861791

G. H. J. van Rees, Rui Zhong Wei, Dameng Deng, (Ben) P. C. Li, Douglas R. Stinson

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

zbMATH Keywords

splitting systemdisjunctive systemex-system

Mathematics Subject Classification ID

Hypergraphs (05C65) Extremal set theory (05D05)

Related Items (3)

On generalizations of separating and splitting families ⋮ On splitting and splittable families ⋮ On the low Hamming weight discrete logarithm problem for nonadjacent representations

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• An exact result for 3-graphs
• Families of finite sets in which no set is covered by the union of two others
• Combinatorial properties of systems of sets
• Intersection statements for systems of sets
• On hypergraphs with every four points spanning at most two triples
• Splitting systems and separating systems.
• Some baby-step giant-step algorithms for the low hamming weight discrete logarithm problem

This page was built for publication: Constructions and bounds for \((m,t)\)-splitting systems