On generalizations of separating and splitting families
From MaRDI portal
Publication:311557
zbMath1344.05143arXiv1412.4683MaRDI QIDQ311557
Samuel Coskey, Luke Serafin, Daniel Condon, Cody B. Stockdale
Publication date: 13 September 2016
Published in: The Electronic Journal of Combinatorics (Search for Journal in Brave)
Full work available at URL: https://arxiv.org/abs/1412.4683
Combinatorial aspects of block designs (05B05) Extremal set theory (05D05) Ordered sets and their cofinalities; pcf theory (03E04)
Related Items (2)
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Constructions and bounds for \((m,t)\)-splitting systems
- Splitting systems and separating systems.
- 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
- On the Size of Separating Systems and Families of Perfect Hash Functions
- Induced Cycle Structures of the Hyperoctahedral Group
- Error Detecting and Error Correcting Codes
- On the cycle index of a product of permutation groups
This page was built for publication: On generalizations of separating and splitting families