{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,4,27]],"date-time":"2026-04-27T11:02:15Z","timestamp":1777287735948,"version":"3.51.4"},"publisher-location":"Berlin, Heidelberg","reference-count":10,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"value":"9783540577850","type":"print"},{"value":"9783540483328","type":"electronic"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[1994]]},"DOI":"10.1007\/3-540-57785-8_183","type":"book-chapter","created":{"date-parts":[[2012,2,26]],"date-time":"2012-02-26T13:21:10Z","timestamp":1330262470000},"page":"699-708","source":"Crossref","is-referenced-by-count":36,"title":["A new approach to information theory"],"prefix":"10.1007","author":[{"given":"Richard J.","family":"Lipton","sequence":"first","affiliation":[]}],"member":"297","published-online":{"date-parts":[[2005,5,31]]},"reference":[{"key":"57_CR1","doi-asserted-by":"crossref","unstructured":"Babai, L., Fortnow L., Levin, L.A., Szegedy M. Checking computations in polylogarithmic time, in Proc. of the 23rd Annual Symp. on Theory of Computing, 21\u201331, 1991.","DOI":"10.1145\/103418.103428"},{"key":"57_CR2","volume-title":"Algebraic Coding Theory","author":"E.R. Berelekamp","year":"1968","unstructured":"Berelekamp, E.R. Algebraic Coding Theory. New York: McGraw-Hill, 1968."},{"key":"57_CR3","first-page":"112","volume":"23","author":"M. Blum","year":"1982","unstructured":"Blum, M. and Micali, S. How to generate cryptographically strong sequences of pseudorandom bits. IEEE FOCS 23, 112\u2013117, 1982.","journal-title":"IEEE FOCS"},{"key":"57_CR4","doi-asserted-by":"crossref","first-page":"644","DOI":"10.1109\/TIT.1976.1055638","volume":"22","author":"W. Diffie","year":"1976","unstructured":"Diffie, W. and Hellman, M.E. New directions in cryptography. IEEE Trans. Info. Theory 22, 644\u2013654, 1976.","journal-title":"IEEE Trans. Info. Theory"},{"key":"57_CR5","unstructured":"Lipton, R. On Coding for Noisy Feasible Channels, unpublished manuscript, 1993."},{"key":"57_CR6","unstructured":"Lagararias, J. C. Pseudorandom Numbers in Probability and Algorithms, National Research Council, 1992."},{"key":"57_CR7","volume-title":"The Theory of Error Correcting Codes","author":"J. MacWilliams","year":"1977","unstructured":"MacWilliams, J., and Sloane, N.J.A. The Theory of Error Correcting Codes. (Elsevier, American ed.) Amsterdam: North-Holland, 1977."},{"key":"57_CR8","volume-title":"The Theory of Information and Coding","author":"R.J. McEliece","year":"1977","unstructured":"McEliece, R.J. The Theory of Information and Coding. Reading, Mass: Addison Wesley, 1977."},{"key":"57_CR9","doi-asserted-by":"crossref","first-page":"379","DOI":"10.1002\/j.1538-7305.1948.tb01338.x","volume":"27","author":"C.E. Shannon","year":"1948","unstructured":"Shannon, C.E. A mathematical theory of communication. Bell System Tech. J. 27, 379\u2013423 and 623\u2013656, 1948.","journal-title":"Bell System Tech. J."},{"key":"57_CR10","unstructured":"Dominic, W. Codes and Cryptography Oxford, 1988."}],"container-title":["Lecture Notes in Computer Science","STACS 94"],"original-title":[],"link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/3-540-57785-8_183.pdf","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2021,4,28]],"date-time":"2021-04-28T01:08:09Z","timestamp":1619572089000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/3-540-57785-8_183"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[1994]]},"ISBN":["9783540577850","9783540483328"],"references-count":10,"URL":"https:\/\/doi.org\/10.1007\/3-540-57785-8_183","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"value":"0302-9743","type":"print"},{"value":"1611-3349","type":"electronic"}],"subject":[],"published":{"date-parts":[[1994]]}}}