{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,6,1]],"date-time":"2025-06-01T04:40:10Z","timestamp":1748752810205,"version":"3.41.0"},"publisher-location":"Cham","reference-count":14,"publisher":"Springer International Publishing","isbn-type":[{"type":"print","value":"9783319271781"},{"type":"electronic","value":"9783319271798"}],"license":[{"start":{"date-parts":[[2015,1,1]],"date-time":"2015-01-01T00:00:00Z","timestamp":1420070400000},"content-version":"unspecified","delay-in-days":0,"URL":"http:\/\/www.springer.com\/tdm"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2015]]},"DOI":"10.1007\/978-3-319-27179-8_2","type":"book-chapter","created":{"date-parts":[[2016,1,14]],"date-time":"2016-01-14T12:09:05Z","timestamp":1452773345000},"page":"25-35","source":"Crossref","is-referenced-by-count":3,"title":["A Number-Theoretic Error-Correcting Code"],"prefix":"10.1007","author":[{"given":"Eric","family":"Brier","sequence":"first","affiliation":[]},{"given":"Jean-S\u00e9bastien","family":"Coron","sequence":"additional","affiliation":[]},{"given":"R\u00e9mi","family":"G\u00e9raud","sequence":"additional","affiliation":[]},{"given":"Diana","family":"Maimu\u0163","sequence":"additional","affiliation":[]},{"given":"David","family":"Naccache","sequence":"additional","affiliation":[]}],"member":"297","published-online":{"date-parts":[[2016,1,15]]},"reference":[{"key":"2_CR1","doi-asserted-by":"crossref","unstructured":"Berrou, C., Glavieux, A., Thitimajshima, P.: Near Shannon limit error-correcting coding and decoding: turbo-codes. In: IEEE International Conference on Communications - ICC 1993, vol. 2, pp. 1064\u20131070, May 1993","DOI":"10.1109\/ICC.1993.397441"},{"key":"2_CR2","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"327","DOI":"10.1007\/978-3-540-85855-3_22","volume-title":"Security and Cryptography for Networks","author":"B Chevallier-Mames","year":"2008","unstructured":"Chevallier-Mames, B., Naccache, D., Stern, J.: Linear bandwidth naccache-stern encryption. In: Ostrovsky, R., De Prisco, R., Visconti, I. (eds.) SCN 2008. LNCS, vol. 5229, pp. 327\u2013339. Springer, Heidelberg (2008)"},{"key":"2_CR3","doi-asserted-by":"publisher","first-page":"411","DOI":"10.1090\/S0025-5718-99-01037-6","volume":"68","author":"P Dusart","year":"1999","unstructured":"Dusart, P.: The $$k{\\rm {th}}$$ prime is greater than $$k (\\ln k+ \\ln \\ln k-1)$$ for $$k \\ge 2$$ . Math. Comput. 68, 411\u2013415 (1999)","journal-title":"Math. Comput."},{"key":"2_CR4","unstructured":"Elias, P.: Coding for noisy channels. In: IRE Convention Record, pp. 37\u201346 (1955)"},{"key":"2_CR5","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"136","DOI":"10.1007\/3-540-36504-4_10","volume-title":"Financial Cryptography","author":"P-A Fouque","year":"2003","unstructured":"Fouque, P.-A., Stern, J., Wackers, G.-J.: CryptoComputing with rationals. In: Blaze, M. (ed.) FC 2002. LNCS, vol. 2357, pp. 136\u2013146. Springer, Heidelberg (2003)"},{"key":"2_CR6","first-page":"170","volume":"24","author":"VD Goppa","year":"1981","unstructured":"Goppa, V.D.: Codes on algebraic curves. Sov. Math. Dokl. 24, 170\u2013172 (1981)","journal-title":"Sov. Math. Dokl."},{"issue":"2","key":"2_CR7","doi-asserted-by":"publisher","first-page":"147","DOI":"10.1002\/j.1538-7305.1950.tb00463.x","volume":"29","author":"RW Hamming","year":"1950","unstructured":"Hamming, R.W.: Error detecting and error correcting codes. Bell Syst. Tech. J. 29(2), 147\u2013160 (1950)","journal-title":"Bell Syst. Tech. J."},{"key":"2_CR8","first-page":"6","volume":"3","author":"DE Muller","year":"1954","unstructured":"Muller, D.E.: Application of boolean algebra to switching circuit design and to error detection. IRE Trans. Inf. Theory 3, 6\u201312 (1954)","journal-title":"IRE Trans. Inf. Theory"},{"key":"2_CR9","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"crossref","first-page":"27","DOI":"10.1007\/3-540-69053-0_3","volume-title":"Advances in Cryptology - EUROCRYPT 1997","author":"D Naccache","year":"1997","unstructured":"Naccache, D., Stern, J.: A new public-key cryptosystem. In: Fumy, W. (ed.) EUROCRYPT 1997. LNCS, vol. 1233, pp. 27\u201336. Springer, Heidelberg (1997)"},{"key":"2_CR10","doi-asserted-by":"publisher","first-page":"38","DOI":"10.1109\/TIT.1954.1057465","volume":"4","author":"I Reed","year":"1954","unstructured":"Reed, I.: A class of multiple-error-correcting codes and the decoding scheme. IRE Trans. Inf. Theory 4, 38\u201349 (1954)","journal-title":"IRE Trans. Inf. Theory"},{"issue":"2","key":"2_CR11","doi-asserted-by":"publisher","first-page":"300","DOI":"10.1137\/0108018","volume":"8","author":"IS Reed","year":"1960","unstructured":"Reed, I.S., Solomon, G.: Polynomial codes over certain finite fields. J. Soc. Ind. Appl. Math. 8(2), 300\u2013304 (1960)","journal-title":"J. Soc. Ind. Appl. Math."},{"key":"2_CR12","first-page":"21","volume":"45","author":"JB Rosser","year":"1938","unstructured":"Rosser, J.B.: The $$n$$ -th prime is greater than $$n \\ln n$$ . Proc. Lond. Math. Soc. 45, 21\u201344 (1938)","journal-title":"Proc. Lond. Math. Soc."},{"issue":"379\u2013423","key":"2_CR13","doi-asserted-by":"publisher","first-page":"623","DOI":"10.1002\/j.1538-7305.1948.tb00917.x","volume":"27","author":"C Shannon","year":"1948","unstructured":"Shannon, C.: A mathematical theory of communication. Bell Syst. Tech. J. 27(379\u2013423), 623\u2013656 (1948)","journal-title":"Bell Syst. Tech. J."},{"issue":"4","key":"2_CR14","doi-asserted-by":"publisher","first-page":"556","DOI":"10.1016\/0196-6774(91)90033-U","volume":"12","author":"B Vall\u00e9e","year":"1991","unstructured":"Vall\u00e9e, B.: Gauss\u2019 algorithm revisited. J. Algorithms 12(4), 556\u2013572 (1991)","journal-title":"J. Algorithms"}],"container-title":["Lecture Notes in Computer Science","Innovative Security Solutions for Information Technology and Communications"],"original-title":[],"link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-319-27179-8_2","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2025,6,1]],"date-time":"2025-06-01T03:58:30Z","timestamp":1748750310000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/978-3-319-27179-8_2"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2015]]},"ISBN":["9783319271781","9783319271798"],"references-count":14,"URL":"https:\/\/doi.org\/10.1007\/978-3-319-27179-8_2","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[2015]]}}}