Bounds on orthogonal arrays and resilient functions
- 1 January 1995
- journal article
- Published by Wiley in Journal of Combinatorial Designs
- Vol. 3 (3) , 179-183
- https://doi.org/10.1002/jcd.3180030304
Abstract
No abstract availableThis publication has 6 references indexed in Scilit:
- On the bit extraction problemPublished by Institute of Electrical and Electronics Engineers (IEEE) ,1992
- Privacy Amplification by Public DiscussionSIAM Journal on Computing, 1988
- The bit extraction problem or t-resilient functionsPublished by Institute of Electrical and Electronics Engineers (IEEE) ,1985
- Four fundamental parameters of a code and their combinatorial significanceInformation and Control, 1973
- Orthogonal Arrays of Index UnityThe Annals of Mathematical Statistics, 1952
- Factorial Experiments Derivable from Combinatorial Arrangements of ArraysJournal of the Royal Statistical Society Series B: Statistical Methodology, 1947