Split Orthogonal Arrays and Maximum Independent Resilient Systems of Functions

Designs, Codes, and Cryptography

Volumn 12, Issue 2, 1997, Pages 131-160

  Levenshtein, Vladimir I ^a  

^a KELDYSH INSTITUTE OF APPLIED MATHEMATICS   (Russian Federation)

Author keywords

Boolean functions; Bounds; Codes; Independence; Resilience; Split orthogonal arrays

Indexed keywords

EID: 0347068300     PISSN: 09251022     EISSN: None     Source Type: Journal    
DOI: 10.1023/A:1008207230165     Document Type: Article

References (40)

1. N. Alon, O. Goldreich, J. Hastad, R. Peralta, Simple constructions of almost k-wise independent random variables, Random Structures and Algorithms, Vol. 3, No. 3 (1992) pp. 289-304.
2. C. H. Bennett, G. Brassard and J.-M. Robert, Privacy amplification by public discussion, SIAM J.Comput., Vol. 17 (1988) pp. 210-229.
3. J. Bierbrauer, K. Gopalakrishnan and D. R. Stinson, Orthogonal arrays, resilient functions, error correcting codes and linear programming bounds, SIAM J. Discrete Math., Vol. 9 (1996) pp. 424-452.
4. A. E. Brouwer, T. Verhoeff, An updated table of minimum-distance bounds for binary linear codes, IEEE Trans. on Inform. Theory, Vol. 39 (1993) pp. 662-677.
5. A. E. Brouwer and L. M. G. M. Tolhuizen, A sharpening of the Johnson bound for binary linear codes and the nonexistence of linear codes with Preparata parameters, Designs, Codes and Cryptography, Vol. 3 (1993) pp. 95-98.
6. P. Camion, C. Carlet, P. Charpin and N. Sendrier, On correlation-immune functions, Lecture Notes in Computer Science, Vol. 576 (1992) pp. 86-100.
7. B. Chor, O. Goldreich, J. Hastad, J. Friedman, S. Rudich and R. Smolensky. The bit extraction problem or t-resilient functions, Proc. 26th IEEE Symp. on Foundations of Computer Science, (1985) pp. 396-407.
8. O. V. Denisov, Asymptotic formula for the number of correlation-ummune boolean functions of order k, Discrete Mathematics, Vol. 2, No. 3 (1991) pp. 25-46 (in Russian).
9. Ph. Delsarte. Bounds for unrestricted codes, by linear programming, Philips Res. Reports, Vol. 27 (1972) pp. 272-289.
10. Ph. Delsarte, Four fundamental parameters of a code and their combinatorial significance, Info. and Control, Vol. 23 (1973) pp. 407-438.
11. Ph. Delsarte. An algebraic approach to the association schemes of coding theory, Philips Res. Reports Suppl., Vol. 10 (1973).
12. C. F. Dunkl. Discrete quadrature and bounds on t-design, Mich. Math. J, Vol. 26 (1979) pp. 81-102.
13. T. Ericson and V. I. Levenshtein, Superimposed codes in the Hamming space, IEEE Trans. Inform. Theory, Vol. 40 (1994) pp. 1882-1893.
14. J. Friedman. On the bit extraction problem, Proc. 33 IEEE Symp. on Foundations of Computer Science, (1992) pp. 314-319.
15. J.-M. Goethals and S. L. Snover. Nearly perfect binary codes, Discrete Math., Vol. 3 (1972) pp. 65-88.
16. X. Guo-zhen and J. L. Massey. A spectral characterization of correlation-immune functions, IEEE Trans. Inform. Theory, Vol. 34 (1988) pp. 569-571.
17. R. W. Hamming, Error detecting and error correcting codes, Bell Syst. Techn. J., Vol. 29 (1950) pp. 147-160.
18. A. M. Kerdock, A class of low rate non-linear codes, Inform. and Control, Vol. 20 (1972) pp. 182-187.
19. M. Krawtchouk, Sur une generalisation des polynomes d'Hermite, Comptes Rendus, Vol. 189 (1929) pp. 620-622.
20. V. I. Levenshtein, On choosing polynomials to obtain bounds in packing problems (in Russian), in Proc. Seventh All-Union Conf. on Coding Theory and Inform Transmission, Part II, Moscow-Vilnius, (1978) pp. 103-108.
21. V. I. Levenshtein, Bounds for packings of metric spaces and some their applications (in Russian), Problemy Kiberneticki, Issue 40, Moscow, "Nauka" Publishing House, (1983) pp. 43-110.
22. V. I. Levenshtein, Designs as maximum codes in polynomial metric spaces, Acta Applicandae Mathematicae, Vol. 29 (1992) pp. 1-82.
23. V. I. Levenshtein, Bounds for self-complementary codes and their applications, in CISM Courses and Lectures - Eurocode 92, Springer Verlag, (1993) pp. 159-171 .
24. V. I. Levenshtein, Krawtchouk polynomials and universal bounds for codes and designs in Hamming spaces, IEEE Trans. Inform. Theory, Vol. 41 (1995) pp. 1303-1321.
25. J. H. Van Lint, Introduction to Coding Theory, Vol. 86 of Graduate texts in Mathematics. Springer-Verlag (1982).
26. U. M. Maurer and J. L. Massey, Local randomness in pseudorandom sequences, Journal of Cryptology, Vol. 4 (1991) pp. 135-149.
27. F. J. MacWilliams and N. J. Sloane. The Theory of Error-correcting Codes, North-Holland (1977).
28. R. J. McEliece, E. R. Rodemich, H. Rumsey Jr., and L. R. Welch, New upper bounds on the rate of a code via the Delsarte-MacWilliams inequalities, IEEE Trans. Inform. Theory, 23 (1977) pp. 157-166.
29. V. Pless, Introduction to the Theory of Error-Correcting Codes, 2nd ed. Wiley, New York (1989).
30. F. P. Preparata, A class of optimum non-linear double-error-correcting codes, Inform. and Control, Vol. 13 (1968) pp. 378-400.
31. C. R. Rao, Factorial experiments derivable from combinatorial arrangements of arrays, J. Royal Stat. Soc., Vol. 9 (1947) pp. 128-139.
32. I. Schoenberg and G. Szego, An extremum problem for polynomials, Composito Math., Vol. 14 (1960) pp. 260-268.
33. E. Seiden, R. Zemach, On orthogonal arrays, Ann. Math. Stat., Vol. 37 (1966) pp. 1355-1370.
34. V. M. Sidelnikov, On extremal polynomials used to estimate the size of codes (in Russian), Problemy Peredachi Informacii, Vol. 16, No. 3 (1980), pp. 17-30. English translation in Problems of Information Transmission, Vol. 16, No. 3 (1980) pp. 174-186.
35. V. M. Sidelnikov, On extremal polynomials used to estimate the size of codes (in Russian), Problemy Peredachi Informacii, Vol. 16, No. 3 (1980), pp. 17-30. English translation in Problems of Information Transmission, Vol. 16, No. 3 (1980) pp. 174-186.
36. T. Siegenthaler, Correlation immunity of nonlinear combining function for cryptographic applications, IEEE Trans. Inform. Theory, Vol. 30 (1984) pp. 776-780.
37. R. C. Singleton, Maximum distance q-ary codes, IEEE Trans. on Inform. Theory, Vol. 10 (1964) pp. 116-118.
38. D. R. Stinson, Resilient functions and large sets of orthogonal arrays, Congressus Numer., Vol. 92 (1993) pp. 105-110.
39. D. R. Stinson and J. L. Massey, An infinite class of counterexamples to a conjecture concerning non-linear resilient functions, J. of Cryptology, Vol. 8, No. 3 (1995) pp. 167-173.
40. L. Teirlinck. Large sets of disjoint designs and structures, in Contemporary Design Theory - A Collection of Surveys, John Wiley & Sons, New York (1992) pp. 561-592.