Bounds for Resilient Functions and Orthogonal Arrays
- 13 July 2001
- book chapter
- Published by Springer Nature
- p. 247-256
- https://doi.org/10.1007/3-540-48658-5_24
Abstract
No abstract availableKeywords
This publication has 9 references indexed in Scilit:
- On Correlation-immune functionsPublished by Springer Nature ,2001
- An updated table of minimum-distance bounds for binary linear codesIEEE Transactions on Information Theory, 1993
- Quantum CryptographyScientific American, 1992
- On the bit extraction problemPublished by Institute of Electrical and Electronics Engineers (IEEE) ,1992
- Privacy Amplification by Public DiscussionSIAM Journal on Computing, 1988
- Analysis and Design of Stream CiphersPublished by Springer Nature ,1986
- The bit extraction problem or t-resilient functionsPublished by Institute of Electrical and Electronics Engineers (IEEE) ,1985
- New upper bounds on the rate of a code via the Delsarte-MacWilliams inequalitiesIEEE Transactions on Information Theory, 1977
- Four fundamental parameters of a code and their combinatorial significanceInformation and Control, 1973