Orthogonal Arrays, Resilient Functions, Error-Correcting Codes, and Linear Programming Bounds
- 1 August 1996
- journal article
- Published by Society for Industrial & Applied Mathematics (SIAM) in SIAM Journal on Discrete Mathematics
- Vol. 9 (3) , 424-452
- https://doi.org/10.1137/s0895480194270950
Abstract
No abstract availableThis publication has 19 references indexed in Scilit:
- On Correlation-immune functionsPublished by Springer Nature ,2001
- Three characterizations of non-binary correlation-immune and resilient functionsDesigns, Codes and Cryptography, 1995
- Bounds on orthogonal arrays and resilient functionsJournal of Combinatorial Designs, 1995
- A note on a conjecture concerning symmetric resilient functionsInformation Processing Letters, 1993
- An updated table of minimum-distance bounds for binary linear codesIEEE Transactions on Information Theory, 1993
- Quantum CryptographyScientific American, 1992
- Privacy Amplification by Public DiscussionSIAM Journal on Computing, 1988
- A study of orthogonal arrays from the point of view of design theoryJournal of Combinatorial Theory, Series A, 1983
- Four fundamental parameters of a code and their combinatorial significanceInformation and Control, 1973
- Orthogonal Arrays of Index UnityThe Annals of Mathematical Statistics, 1952