{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,7,30]],"date-time":"2025-07-30T14:15:51Z","timestamp":1753884951905},"publisher-location":"Berlin, Heidelberg","reference-count":14,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"type":"print","value":"9783540583332"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"DOI":"10.1007\/3-540-48658-5_24","type":"book-chapter","created":{"date-parts":[[2007,8,9]],"date-time":"2007-08-09T20:50:39Z","timestamp":1186692639000},"page":"247-256","source":"Crossref","is-referenced-by-count":29,"title":["Bounds for Resilient Functions and Orthogonal Arrays"],"prefix":"10.1007","author":[{"given":"J\u00fcrgen","family":"Bierbrauer","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"K.","family":"Gopalakrishnan","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"D. R.","family":"Stinson","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","reference":[{"issue":"4","key":"24_CR1","doi-asserted-by":"publisher","first-page":"26","DOI":"10.1038\/scientificamerican1092-50","volume":"267","author":"C. H. Bennett","year":"1992","unstructured":"C. H. Bennett, G. Brassard, A. K. Ekert: Quantum cryptography. Scientific American 267(4) (1992), 26\u201333","journal-title":"Scientific American"},{"key":"24_CR2","doi-asserted-by":"publisher","first-page":"210","DOI":"10.1137\/0217014","volume":"17","author":"C. H. Bennett","year":"1988","unstructured":"C. H. Bennett, G. Brassard, J. M. Robert: Privacy amplification by public discussion. SIAM J. Computing 17 (1988), 210\u2013229","journal-title":"SIAM J. Computing"},{"key":"24_CR3","unstructured":"J. Bierbrauer: Bounds on orthogonal arrays and codes. Preprint"},{"key":"24_CR4","doi-asserted-by":"publisher","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 Transactions on Information Theory 39 (1993), 662\u2013677","journal-title":"IEEE Transactions on Information Theory"},{"key":"24_CR5","series-title":"Lect Notes Comput Sci","doi-asserted-by":"publisher","first-page":"86","DOI":"10.1007\/3-540-46766-1_6","volume-title":"Advances in Cryptology \u2014 CRYPTO\u2019 91","author":"P. Camion","year":"1992","unstructured":"P. Camion, C. Carlet, P. Charpin, N. Sendrier: On correlation-immune functions. In: Advances in Cryptology \u2014 CRYPTO\u2019 91. Lecture Notes in Computer Science 576 (1992), 86\u2013100"},{"key":"24_CR6","doi-asserted-by":"crossref","unstructured":"B. Chor, O. Goldreich, J. H\u00e5stad, J. Friedman, S. Rudich, R. Smolensky: The bit extraction problem or t\u2014resilient functions. In: 26th IEEE Symposium on Foundations of Computer Science, 1985, pp. 396\u2013407","DOI":"10.1109\/SFCS.1985.55"},{"key":"24_CR7","doi-asserted-by":"publisher","first-page":"407","DOI":"10.1016\/S0019-9958(73)80007-5","volume":"23","author":"P. Delsarte","year":"1973","unstructured":"P. Delsarte: Four fundamental parameters of a code and their combinatorial significance. Information and Control 23 (1973), 407\u2013438","journal-title":"Information and Control"},{"key":"24_CR8","doi-asserted-by":"crossref","unstructured":"J. Friedman: On the bit extraction problem. In: 33rd IEEE Symposium on Foundations of Computer Science, 1992, pp. 314\u2013319","DOI":"10.1109\/SFCS.1992.267760"},{"key":"24_CR9","unstructured":"K. Gopalakrishnan, D. R. Stinson: Characterizations of non-binary correlation-immune and resilient functions. Technical Report UNL-CSE-93-010, University of Nebraska, March 1993. Submitted to: Designs, Codes and Cryptography"},{"key":"24_CR10","unstructured":"K. Gopalakrishnan, D. R. Stinson, J. Bierbrauer: Orthogonal arrays, resilient functions, error correcting codes and linear programming bounds. Preprint"},{"key":"24_CR11","unstructured":"F. J. MacWilliams, N. J. A. Sloane: The Theory of Error-Correcting Codes, North-Holland, 1977"},{"key":"24_CR12","doi-asserted-by":"publisher","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, L. R. Welch: New upper bounds on the rate of a code via the Delsarte-McWilliams inequalities. IEEE Trans. on Information Theory 23 (1977), 157\u2013166","journal-title":"IEEE Trans. on Information Theory"},{"key":"24_CR13","doi-asserted-by":"crossref","unstructured":"R. A. Rueppel: Analysis and Design of Stream Ciphers, Springer-Verlag, 1986","DOI":"10.1007\/978-3-642-82865-2"},{"key":"24_CR14","first-page":"105","volume":"92","author":"D. R. Stinson","year":"1993","unstructured":"D. R. Stinson: Resilient functions and large sets of orthogonal arrays. Congressus Numerantium 92 (1993), 105\u2013110","journal-title":"Congressus Numerantium"}],"container-title":["Lecture Notes in Computer Science","Advances in Cryptology \u2014 CRYPTO \u201994"],"original-title":[],"language":"en","link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/3-540-48658-5_24.pdf","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2021,4,28]],"date-time":"2021-04-28T00:50:47Z","timestamp":1619571047000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/3-540-48658-5_24"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[null]]},"ISBN":["9783540583332"],"references-count":14,"URL":"https:\/\/doi.org\/10.1007\/3-540-48658-5_24","relation":{},"subject":[]}}