Splitting systems and separating systems

Discrete Mathematics

Volumn 279, Issue 1-3, 2004, Pages 355-368

  Ling, Alan C H ^a   Li, P C ^b   Van Rees, G H J ^b  

^a University of Vermont   (United States)

^b UNIVERSITY OF MANITOBA   (Canada)

Author keywords

Separating systems; Splitting systems

Indexed keywords

ALGORITHMS; MATRIX ALGEBRA; SET THEORY; THEOREM PROVING;

SEPARATING SYSTEMS; SPLITTING SYSTEMS;

SYSTEMS ANALYSIS;

EID: 1342287201     PISSN: 0012365X     EISSN: None     Source Type: Journal    
DOI: 10.1016/S0012-365X(03)00280-2     Document Type: Article

References (6)

1. Fredman M.L., Komlós J. On the size of separating systems and families of perfect hash functions. SIAM J. Algebraic Discrete Methods. 5(1):1984;61-68.
2. Friedman A.D., Graham R.L., Ullman J.D. Universal single transition time asynchronous state assignments. IEEE Trans. Comput. C-18(6):1969;541-547.
3. MacWilliams F.J., Sloane N.J.A. The Theory of Error Correcting Codes. 1977;North-Holland, New York.
4. Rényi A. On random generating elements of a finite Boolean algebra. Acta Sci. Math. Szeged. 22:1961;75-81.
5. Stinson D.R. Some baby-step giant-step algorithms for the low hamming weight discrete logarithm problem. Math. Comput. 71:2002;379-391.
6. Stinson D.R., van Trung T., Wei R. Secure frameproof codes, key distribution patterns, group testing algorithms and related structures. J. Statist. Plann. Inference. 86:2000;595-617.