{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,6,2]],"date-time":"2026-06-02T19:36:07Z","timestamp":1780428967334,"version":"3.54.1"},"reference-count":13,"publisher":"Springer Science and Business Media LLC","issue":"3","license":[{"start":{"date-parts":[[1995,9,1]],"date-time":"1995-09-01T00:00:00Z","timestamp":809913600000},"content-version":"tdm","delay-in-days":0,"URL":"http:\/\/www.springer.com\/tdm"}],"content-domain":{"domain":["link.springer.com"],"crossmark-restriction":false},"short-container-title":["J. Cryptology"],"published-print":{"date-parts":[[1995,9]]},"DOI":"10.1007\/bf00202271","type":"journal-article","created":{"date-parts":[[2004,8,31]],"date-time":"2004-08-31T01:11:44Z","timestamp":1093914704000},"page":"167-173","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":46,"title":["An infinite class of counterexamples to a conjecture concerning nonlinear resilient functions"],"prefix":"10.1007","volume":"8","author":[{"given":"D. R.","family":"Stinson","sequence":"first","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]},{"given":"J. L.","family":"Massey","sequence":"additional","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]}],"member":"297","reference":[{"key":"BF00202271_CR1","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.\n17 (1988), 210\u2013229.","journal-title":"SIAM J. Comput."},{"key":"BF00202271_CR2","volume-title":"Algebraic Coding Theory","author":"E. R. Berlekamp","year":"1984","unstructured":"E. R. Berlekamp. Algebraic Coding Theory, Aegean Park Press, Laguna Hills, CA, 1984."},{"key":"BF00202271_CR3","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 Cryptography\n3 (1993), 95\u201398.","journal-title":"Designs Codes Cryptography"},{"key":"BF00202271_CR4","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"},{"key":"BF00202271_CR5","unstructured":"P. Delsarte. An Algebraic Approach to the Association Schemes of Coding Theory. Philips Research Reports Supplements, vol. 10, 1973."},{"key":"BF00202271_CR6","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.\n3 (1972), 65\u201388.","journal-title":"Discrete Math."},{"key":"BF00202271_CR7","unstructured":"K. Gopalakrishnan and D. R. Stinson. Three characterizations of non-binary correlationimmune and resilient functions. Designs Codes Cryptography, to appear."},{"key":"BF00202271_CR8","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\n20 (1972), 182\u2013187.","journal-title":"Inform. and Control"},{"key":"BF00202271_CR9","volume-title":"The Theory of Error-Correcting Codes","author":"F. J. MacWilliams","year":"1977","unstructured":"F. J. MacWilliams and N. J. A. Sloane. The Theory of Error-Correcting Codes, North-Holland, Amsterdam, 1977."},{"key":"BF00202271_CR10","doi-asserted-by":"crossref","unstructured":"U. M. Maurer and J. L. Massey. Local randomness in pseudorandom sequences. J. Cryptology b (1991), 135\u2013149.","DOI":"10.1007\/BF00196773"},{"key":"BF00202271_CR11","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\n13 (1968), 378\u2013400.","journal-title":"Inform. and Control"},{"key":"BF00202271_CR12","first-page":"105","volume":"92","author":"D. R. Stinson","year":"1993","unstructured":"D. R. Stinson. Resilient functions and large sets of orthogonal arrays. Congr. Numer.\n92 (1993), 105\u2013110.","journal-title":"Congr. Numer."},{"key":"BF00202271_CR13","doi-asserted-by":"crossref","first-page":"665","DOI":"10.1109\/TIT.1987.1057356","volume":"33","author":"T. Verhoeff","year":"1987","unstructured":"T. Verhoeff. An updated table of minimum-distance bounds for binary linear codes. IEEE Trans. Inform. Theory\n33 (1987), 665\u2013680.","journal-title":"IEEE Trans. Inform. Theory"}],"container-title":["Journal of Cryptology"],"original-title":[],"language":"en","link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/BF00202271.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/article\/10.1007\/BF00202271\/fulltext.html","content-type":"text\/html","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/BF00202271","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"},{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/BF00202271.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2020,4,8]],"date-time":"2020-04-08T08:21:14Z","timestamp":1586334074000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/BF00202271"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[1995,9]]},"references-count":13,"journal-issue":{"issue":"3","published-print":{"date-parts":[[1995,9]]}},"alternative-id":["BF00202271"],"URL":"https:\/\/doi.org\/10.1007\/bf00202271","relation":{},"ISSN":["0933-2790","1432-1378"],"issn-type":[{"value":"0933-2790","type":"print"},{"value":"1432-1378","type":"electronic"}],"subject":[],"published":{"date-parts":[[1995,9]]},"assertion":[{"value":"15 September 1993","order":1,"name":"received","label":"Received","group":{"name":"ArticleHistory","label":"Article History"}},{"value":"9 March 1994","order":2,"name":"revised","label":"Revised","group":{"name":"ArticleHistory","label":"Article History"}},{"value":"This content has been made available to all.","name":"free","label":"Free to read"}]}}