Citation: Dr. Stinson et R. Wei, COMBINATORIAL PROPERTIES AND CONSTRUCTIONS OF TRACEABILITY SCHEMES AND FRAMEPROOF CODES, SIAM journal on discrete mathematics, 11(1), 1998, pp. 41-53
Citation: C. Blundo et al., GENERALIZED BEIMEL-CHOR SCHEMES FOR BROADCAST ENCRYPTION AND INTERACTIVE KEY DISTRIBUTION, Theoretical computer science, 200(1-2), 1998, pp. 313-334
Citation: J. Bierbrauer et al., ORTHOGONAL ARRAYS, RESILIENT FUNCTIONS, ERROR-CORRECTING CODES, AND LINEAR-PROGRAMMING BOUNDS, SIAM journal on discrete mathematics, 9(3), 1996, pp. 424-452
Citation: K. Gopalakrishnan et Dr. Stinson, A SIMPLE ANALYSIS OF THE ERROR-PROBABILITY OF 2-POINT BASED SAMPLING, Information processing letters, 60(2), 1996, pp. 91-96
Citation: Dr. Stinson et Jl. Massey, AN INFINITE CLASS OF COUNTEREXAMPLES TO A CONJECTURE CONCERNING NONLINEAR RESILIENT FUNCTIONS, Journal of cryptology, 8(3), 1995, pp. 167-173
Citation: K. Gopalakrishnan et al., A NOTE ON A CONJECTURE CONCERNING SYMMETRICAL RESILIENT FUNCTIONS, Information processing letters, 47(3), 1993, pp. 139-143