{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,8,2]],"date-time":"2025-08-02T19:06:17Z","timestamp":1754161577072,"version":"3.41.2"},"reference-count":39,"publisher":"Springer Science and Business Media LLC","issue":"2","license":[{"start":{"date-parts":[[1997,10,1]],"date-time":"1997-10-01T00:00:00Z","timestamp":875664000000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.springernature.com\/gp\/researchers\/text-and-data-mining"},{"start":{"date-parts":[[1997,10,1]],"date-time":"1997-10-01T00:00:00Z","timestamp":875664000000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/www.springernature.com\/gp\/researchers\/text-and-data-mining"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":["Designs, Codes and Cryptography"],"published-print":{"date-parts":[[1997,10]]},"DOI":"10.1023\/a:1008207230165","type":"journal-article","created":{"date-parts":[[2002,12,22]],"date-time":"2002-12-22T08:47:34Z","timestamp":1040546854000},"page":"131-160","source":"Crossref","is-referenced-by-count":8,"title":["Split Orthogonal Arrays and Maximum Independent Resilient Systems of Functions"],"prefix":"10.1007","volume":"12","author":[{"given":"Vladimir I.","family":"Levenshtein","sequence":"first","affiliation":[]}],"member":"297","reference":[{"issue":"3","key":"139525_CR1","doi-asserted-by":"crossref","first-page":"289","DOI":"10.1002\/rsa.3240030308","volume":"3","author":"N. Alon","year":"1992","unstructured":"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\u2013304.","journal-title":"Random Structures and Algorithms"},{"key":"139525_CR2","doi-asserted-by":"crossref","first-page":"210","DOI":"10.1137\/0217014","volume":"17","author":"C. H. Bennett","year":"1988","unstructured":"C. H. Bennett, G. Brassard and J.-M. Robert, Privacy amplification by public discussion, SIAM J. Comput., Vol. 17 (1988) pp. 210\u2013229.","journal-title":"SIAM J. Comput."},{"key":"139525_CR3","doi-asserted-by":"crossref","first-page":"424","DOI":"10.1137\/S0895480194270950","volume":"9","author":"J. Bierbrauer","year":"1996","unstructured":"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\u2013452.","journal-title":"SIAM J. Discrete Math."},{"key":"139525_CR4","doi-asserted-by":"crossref","first-page":"662","DOI":"10.1109\/18.212301","volume":"39","author":"A. E. Brouwer","year":"1993","unstructured":"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\u2013677.","journal-title":"IEEE Trans. on Inform. Theory"},{"key":"139525_CR5","doi-asserted-by":"crossref","first-page":"95","DOI":"10.1007\/BF01388407","volume":"3","author":"A. E. Brouwer","year":"1993","unstructured":"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\u201398.","journal-title":"Designs, Codes and Cryptography"},{"key":"139525_CR6","doi-asserted-by":"crossref","unstructured":"P. Camion, C. Carlet, P. Charpin and N. Sendrier, On correlation-immune functions, Lecture Notes in Computer Science, Vol. 576 (1992) pp. 86\u2013100.","DOI":"10.1007\/3-540-46766-1_6"},{"key":"139525_CR7","doi-asserted-by":"crossref","unstructured":"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\u2013407.","DOI":"10.1109\/SFCS.1985.55"},{"issue":"3","key":"139525_CR8","first-page":"25","volume":"2","author":"O. V. Denisov","year":"1991","unstructured":"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\u201346 (in Russian).","journal-title":"Discrete Mathematics"},{"key":"139525_CR9","first-page":"272","volume":"27","author":"P. Delsarte","year":"1972","unstructured":"Ph. Delsarte. Bounds for unrestricted codes, by linear programming, Philips Res. Reports, Vol. 27 (1972) pp. 272\u2013289.","journal-title":"Philips Res. Reports"},{"key":"139525_CR10","doi-asserted-by":"crossref","first-page":"407","DOI":"10.1016\/S0019-9958(73)80007-5","volume":"23","author":"P. Delsarte","year":"1973","unstructured":"Ph. Delsarte, Four fundamental parameters of a code and their combinatorial significance. Info. and Control, Vol. 23 (1973) pp. 407\u2013438.","journal-title":"Info. and Control"},{"key":"139525_CR11","unstructured":"Ph. Delsarte. An algebraic approach to the association schemes of coding theory, Philips Res. Reports Suppl., Vol. 10 (1973)."},{"key":"139525_CR12","doi-asserted-by":"crossref","first-page":"81","DOI":"10.1307\/mmj\/1029002165","volume":"26","author":"C. F. Dunkl","year":"1979","unstructured":"C. F. Dunkl. Discrete quadrature and bounds on t-design, Mich. Math. J, Vol. 26 (1979) pp. 81\u2013102.","journal-title":"Mich. Math. J"},{"key":"139525_CR13","doi-asserted-by":"crossref","first-page":"1882","DOI":"10.1109\/18.340463","volume":"40","author":"T. Ericson","year":"1994","unstructured":"T. Ericson and V. I. Levenshtein, Superimposed codes in the Hamming space, IEEE Trans. Inform. Theory, Vol. 40 (1994) pp. 1882\u20131893.","journal-title":"IEEE Trans. Inform. Theory"},{"key":"139525_CR14","doi-asserted-by":"crossref","unstructured":"J. Friedman. On the bit extraction problem, Proc. 33 IEEE Symp. on Foundations of Computer Science, (1992) pp. 314\u2013319.","DOI":"10.1109\/SFCS.1992.267760"},{"key":"139525_CR15","doi-asserted-by":"crossref","first-page":"65","DOI":"10.1016\/0012-365X(72)90025-8","volume":"3","author":"J.-M. Goethals","year":"1972","unstructured":"J.-M. Goethals and S. L. Snover. Nearly perfect binary codes, Discrete Math., Vol. 3 (1972) pp. 65\u201388.","journal-title":"Discrete Math."},{"key":"139525_CR16","doi-asserted-by":"crossref","first-page":"569","DOI":"10.1109\/18.6037","volume":"34","author":"X. Guo-zhen","year":"1988","unstructured":"X. Guo-zhen and J. L. Massey. A spectral characterization of correlation-immune functions, IEEE Trans. Inform. Theory, Vol. 34 (1988) pp. 569\u2013571.","journal-title":"IEEE Trans. Inform. Theory"},{"key":"139525_CR17","doi-asserted-by":"crossref","first-page":"147","DOI":"10.1002\/j.1538-7305.1950.tb00463.x","volume":"29","author":"R. W. Hamming","year":"1950","unstructured":"R. W. Hamming, Error detecting and error correcting codes, Bell Syst. Techn. J., Vol. 29 (1950) pp. 147\u2013160.","journal-title":"Bell Syst. Techn. J."},{"key":"139525_CR18","doi-asserted-by":"crossref","first-page":"182","DOI":"10.1016\/S0019-9958(72)90376-2","volume":"20","author":"A. M. Kerdock","year":"1972","unstructured":"A. M. Kerdock, A class of low rate non-linear codes, Inform. and Control, Vol. 20 (1972) pp. 182\u2013187.","journal-title":"Inform. and Control"},{"key":"139525_CR19","first-page":"620","volume":"189","author":"M. Krawtchouk","year":"1929","unstructured":"M. Krawtchouk, Sur une generalisation des polynomes d'Hermite, Comptes Rendus, Vol. 189 (1929) pp. 620\u2013622.","journal-title":"Comptes Rendus"},{"key":"139525_CR20","unstructured":"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\u2013108."},{"key":"139525_CR21","first-page":"43","volume-title":"Problemy Kiberneticki","author":"V. I. Levenshtein","year":"1983","unstructured":"V. I. Levenshtein, Bounds for packings of metric spaces and some their applications (in Russian), Problemy Kiberneticki, Issue 40, Moscow, \u201cNauka\u201d Publishing House, (1983) pp. 43\u2013110."},{"key":"139525_CR22","doi-asserted-by":"crossref","first-page":"1","DOI":"10.1007\/BF00053379","volume":"29","author":"V.I. Levenshtein","year":"1992","unstructured":"V.I. Levenshtein, Designs as maximum codes in polynomial metric spaces, Acta Applicandae Mathematicae, Vol. 29 (1992) pp. 1\u201382.","journal-title":"Acta Applicandae Mathematicae"},{"key":"139525_CR23","doi-asserted-by":"crossref","unstructured":"V. I. Levenshtein, Bounds for self-complementary codes and their applications, in CISM Courses and Lectures\u2014Eurocode 92, Springer Verlag, (1993) pp. 159\u2013171.","DOI":"10.1007\/978-3-7091-2786-5_14"},{"key":"139525_CR24","doi-asserted-by":"crossref","first-page":"1303","DOI":"10.1109\/18.412678","volume":"41","author":"V. I. Levenshtein","year":"1995","unstructured":"V. I. Levenshtein, Krawtchouk polynomials and universal bounds for codes and designs in Hamming spaces, IEEE Trans. Inform. Theory, Vol. 41 (1995) pp. 1303\u20131321.","journal-title":"IEEE Trans. Inform. Theory"},{"key":"139525_CR25","doi-asserted-by":"crossref","unstructured":"J. H. Van Lint, Introduction to Coding Theory, Vol. 86 of Graduate texts in Mathematics. Springer-Verlag (1982).","DOI":"10.1007\/978-3-662-07998-0"},{"key":"139525_CR26","doi-asserted-by":"crossref","first-page":"135","DOI":"10.1007\/BF00196773","volume":"4","author":"U. M. Maurer","year":"1991","unstructured":"U. M. Maurer and J. L. Massey, Local randomness in pseudorandom sequences, Journal of Cryptology, Vol. 4 (1991) pp. 135\u2013149.","journal-title":"Journal of Cryptology"},{"key":"139525_CR27","unstructured":"F. J. MacWilliams and N. J. Sloane. The Theory of Error-correcting Codes, North-Holland (1977)."},{"key":"139525_CR28","doi-asserted-by":"crossref","first-page":"157","DOI":"10.1109\/TIT.1977.1055688","volume":"23","author":"R. J. McEliece","year":"1977","unstructured":"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\u2013166.","journal-title":"IEEE Trans. Inform. Theory"},{"key":"139525_CR29","volume-title":"Introduction to the Theory of Error-Correcting Codes","author":"V. Pless","year":"1989","unstructured":"V. Pless, Introduction to the Theory of Error-Correcting Codes, 2nd ed. Wiley, New York (1989).","edition":"2nd ed."},{"key":"139525_CR30","doi-asserted-by":"crossref","first-page":"378","DOI":"10.1016\/S0019-9958(68)90874-7","volume":"13","author":"F. P. Preparata","year":"1968","unstructured":"F. P. Preparata, A class of optimum non-linear double-error-correcting codes, Inform. and Control, Vol. 13 (1968) pp. 378\u2013400.","journal-title":"Inform. and Control"},{"key":"139525_CR31","doi-asserted-by":"crossref","first-page":"128","DOI":"10.2307\/2983576","volume":"9","author":"C. R. Rao","year":"1947","unstructured":"C. R. Rao, Factorial experiments derivable from combinatorial arrangements of arrays, J. Royal Stat. Soc., Vol. 9 (1947) pp. 128\u2013139.","journal-title":"J. Royal Stat. Soc."},{"key":"139525_CR32","first-page":"260","volume":"14","author":"I. Schoenberg","year":"1960","unstructured":"I. Schoenberg and G. Szego, An extremum problem for polynomials, Composito Math., Vol. 14 (1960) pp. 260\u2013268.","journal-title":"Composito Math."},{"key":"139525_CR33","doi-asserted-by":"crossref","first-page":"1355","DOI":"10.1214\/aoms\/1177699280","volume":"37","author":"E. Seiden","year":"1966","unstructured":"E. Seiden, R. Zemach, On orthogonal arrays, Ann. Math. Stat., Vol. 37 (1966) pp. 1355\u20131370.","journal-title":"Ann. Math. Stat."},{"issue":"3","key":"139525_CR34","first-page":"17","volume":"16","author":"V. M. Sidelnikov","year":"1980","unstructured":"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\u201330. English translation in Problems of Information Transmission, Vol. 16, No. 3 (1980) pp. 174\u2013186.","journal-title":"Problemy Peredachi Informacii"},{"key":"139525_CR35","doi-asserted-by":"crossref","first-page":"776","DOI":"10.1109\/TIT.1984.1056949","volume":"30","author":"T. Siegenthaler","year":"1984","unstructured":"T. Siegenthaler, Correlation immunity of nonlinear combining function for cryptographic applications, IEEE Trans. Inform. Theory, Vol. 30 (1984) pp. 776\u2013780.","journal-title":"IEEE Trans. Inform. Theory"},{"key":"139525_CR36","doi-asserted-by":"crossref","first-page":"116","DOI":"10.1109\/TIT.1964.1053661","volume":"10","author":"R. C. Singleton","year":"1964","unstructured":"R. C. Singleton, Maximum distance q-ary codes, IEEE Trans. on Inform. Theory, Vol. 10 (1964) pp. 116\u2013118.","journal-title":"IEEE Trans. on Inform. Theory"},{"key":"139525_CR37","first-page":"105","volume":"92","author":"D. R. Stinson","year":"1993","unstructured":"D. R. Stinson, Resilient functions and large sets of orthogonal arrays, Congressus Numer., Vol. 92 (1993) pp. 105\u2013110.","journal-title":"Congressus Numer."},{"issue":"3","key":"139525_CR38","doi-asserted-by":"crossref","first-page":"167","DOI":"10.1007\/BF00202271","volume":"8","author":"D. R. Stinson","year":"1995","unstructured":"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\u2013173.","journal-title":"J. of Cryptology"},{"key":"139525_CR39","first-page":"561","volume-title":"Contemporary Design Theory\u2014A Collection of Surveys","author":"L. Teirlinck","year":"1992","unstructured":"L. Teirlinck. Large sets of disjoint designs and structures. in Contemporary Design Theory\u2014A Collection of Surveys, John Wiley & Sons, New York (1992) pp. 561\u2013592."}],"container-title":["Designs, Codes and Cryptography"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1023\/A:1008207230165.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/link.springer.com\/article\/10.1023\/A:1008207230165\/fulltext.html","content-type":"text\/html","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1023\/A:1008207230165.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2025,7,29]],"date-time":"2025-07-29T03:41:21Z","timestamp":1753760481000},"score":1,"resource":{"primary":{"URL":"https:\/\/link.springer.com\/10.1023\/A:1008207230165"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[1997,10]]},"references-count":39,"journal-issue":{"issue":"2","published-print":{"date-parts":[[1997,10]]}},"alternative-id":["139525"],"URL":"https:\/\/doi.org\/10.1023\/a:1008207230165","relation":{},"ISSN":["0925-1022","1573-7586"],"issn-type":[{"type":"print","value":"0925-1022"},{"type":"electronic","value":"1573-7586"}],"subject":[],"published":{"date-parts":[[1997,10]]}}}