{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2024,9,10]],"date-time":"2024-09-10T05:29:17Z","timestamp":1725946157654},"publisher-location":"Cham","reference-count":16,"publisher":"Springer International Publishing","isbn-type":[{"type":"print","value":"9783319738291"},{"type":"electronic","value":"9783319738307"}],"license":[{"start":{"date-parts":[[2018,1,1]],"date-time":"2018-01-01T00:00:00Z","timestamp":1514764800000},"content-version":"unspecified","delay-in-days":0,"URL":"http:\/\/www.springer.com\/tdm"}],"content-domain":{"domain":["link.springer.com"],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2018]]},"DOI":"10.1007\/978-3-319-73830-7_1","type":"book-chapter","created":{"date-parts":[[2018,1,17]],"date-time":"2018-01-17T09:13:00Z","timestamp":1516180380000},"page":"1-10","update-policy":"http:\/\/dx.doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":0,"title":["Sphere Decoding Algorithm Based on a New Radius Definition"],"prefix":"10.1007","author":[{"given":"Ping","family":"Wang","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"DongDong","family":"Shang","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Zhiwei","family":"Sun","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","published-online":{"date-parts":[[2018,1,18]]},"reference":[{"issue":"8","key":"1_CR1","doi-asserted-by":"crossref","first-page":"2806","DOI":"10.1109\/TSP.2005.850352","volume":"53","author":"B Hassibi","year":"2005","unstructured":"Hassibi, B., Vikalo, H.: On the sphere-decoding algorithm I. Expected complexity. IEEE Trans. Signal Process. 53(8), 2806\u20132818 (2005)","journal-title":"IEEE Trans. Signal Process."},{"key":"1_CR2","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"112","DOI":"10.1007\/BFb0052231","volume-title":"Advances in Cryptology \u2014 CRYPTO \u201997","author":"O Goldreich","year":"1997","unstructured":"Goldreich, O., Goldwasser, S., Halevi, S.: Public-key cryptosystems from lattice reduction problems. In: Kaliski, B.S. (ed.) CRYPTO 1997. LNCS, vol. 1294, pp. 112\u2013131. Springer, Heidelberg (1997). https:\/\/doi.org\/10.1007\/BFb0052231"},{"issue":"11","key":"1_CR3","doi-asserted-by":"crossref","first-page":"2938","DOI":"10.1109\/78.726808","volume":"46","author":"A Hassibi","year":"1998","unstructured":"Hassibi, A., Boyd, S.: Integer parameter estimation in linear models with applications to GPS. IEEE Trans. Signal Process. 46(11), 2938\u20132952 (1998)","journal-title":"IEEE Trans. Signal Process."},{"key":"1_CR4","doi-asserted-by":"crossref","DOI":"10.1007\/978-3-540-88702-7","volume-title":"Introduction to Post-Quantum Cryptography","author":"DJ Bernstein","year":"2009","unstructured":"Bernstein, D.J.: Introduction to Post-Quantum Cryptography. Springer, Heidelberg (2009)"},{"key":"1_CR5","doi-asserted-by":"crossref","unstructured":"Ajtai, M.: Generating hard instances of lattice problems (extended abstract). In: Twenty-Eighth ACM Symposium on Theory of Computing, pp. 99\u2013108 (1996)","DOI":"10.1145\/237814.237838"},{"key":"1_CR6","doi-asserted-by":"crossref","unstructured":"Gentry, C.: Fully homomorphic encryption using ideal lattices. In: ACM Symposium on Theory of Computing, STOC 2009, Bethesda, MD, USA, 31 May\u20132 June 2009, pp. 169\u2013178 (2009)","DOI":"10.1145\/1536414.1536440"},{"key":"1_CR7","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"267","DOI":"10.1007\/BFb0054868","volume-title":"Algorithmic Number Theory","author":"J Hoffstein","year":"1998","unstructured":"Hoffstein, J., Pipher, J., Silverman, J.H.: NTRU: a ring-based public key cryptosystem. In: Buhler, J.P. (ed.) ANTS 1998. LNCS, vol. 1423, pp. 267\u2013288. Springer, Heidelberg (1998). https:\/\/doi.org\/10.1007\/BFb0054868"},{"issue":"9","key":"1_CR8","doi-asserted-by":"crossref","first-page":"1001","DOI":"10.1109\/LCOMM.2011.072011.110916","volume":"15","author":"KC Lai","year":"2011","unstructured":"Lai, K.C., Huang, C.C., Jia, J.J.: Variation of the fixed-complexity sphere decoder. IEEE Commun. Lett. 15(9), 1001\u20131003 (2011)","journal-title":"IEEE Commun. Lett."},{"issue":"3","key":"1_CR9","doi-asserted-by":"crossref","first-page":"1518","DOI":"10.1109\/TIT.2011.2177590","volume":"58","author":"JW Choi","year":"2012","unstructured":"Choi, J.W., Shim, B., Singer, A.C.: Efficient soft-input soft-output tree detection via an improved path metric. IEEE Trans. Inf. Theor. 58(3), 1518\u20131533 (2012)","journal-title":"IEEE Trans. Inf. Theor."},{"issue":"1\u20133","key":"1_CR10","doi-asserted-by":"crossref","first-page":"181","DOI":"10.1007\/BF01581144","volume":"66","author":"C Schnorr","year":"1994","unstructured":"Schnorr, C., Euchner, M.: Lattice basis reduction: improved practical algorithms and solving subset sum problems. Math. Program. 66(1\u20133), 181\u2013199 (1994)","journal-title":"Math. Program."},{"key":"1_CR11","doi-asserted-by":"crossref","first-page":"463","DOI":"10.1090\/S0025-5718-1985-0777278-8","volume":"44","author":"U Fincke","year":"1985","unstructured":"Fincke, U., Pohst, M.: Improved methods for calculating vectors of short length in a lattice. Math. Comput. 44, 463\u2013471 (1985)","journal-title":"Math. Comput."},{"issue":"5","key":"1_CR12","doi-asserted-by":"crossref","first-page":"1639","DOI":"10.1109\/18.771234","volume":"45","author":"E Viterbo","year":"1999","unstructured":"Viterbo, E., Boutros, J.: A universal lattice code decoder for fading channels. IEEE Trans. Inf. Theor. 45(5), 1639\u20131642 (1999)","journal-title":"IEEE Trans. Inf. Theor."},{"issue":"7","key":"1_CR13","doi-asserted-by":"crossref","first-page":"2137","DOI":"10.1109\/TWC.2010.07.100258","volume":"9","author":"M Samuel","year":"2010","unstructured":"Samuel, M., Fitz, M.: Iterative sphere detectors based on the Schnorr-Euchner enumeration. IEEE Trans. Wirel. Commun. 9(7), 2137\u20132144 (2010)","journal-title":"IEEE Trans. Wirel. Commun."},{"issue":"8","key":"1_CR14","first-page":"1","volume":"40","author":"M Grtschel","year":"1988","unstructured":"Grtschel, M., Lovsz, L., Schrijver, A.: Geometric algorithms and combinatorial optimization. Algorithms Comb. 40(8), 1\u2013362 (1988)","journal-title":"Algorithms Comb."},{"key":"1_CR15","doi-asserted-by":"crossref","unstructured":"Pohst, M.: On the computation of lattice vectors of minimal length, successive minima and reduced bases with applications. ACM (1981)","DOI":"10.1145\/1089242.1089247"},{"key":"1_CR16","doi-asserted-by":"crossref","unstructured":"Qiao, S.: Integer least squares: sphere decoding and the LLL algorithm. In: C 3 S 2 E Conference, pp. 23\u201328 (2008)","DOI":"10.1145\/1370256.1370261"}],"container-title":["Lecture Notes in Computer Science","Smart Computing and Communication"],"original-title":[],"link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-319-73830-7_1","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2019,10,9]],"date-time":"2019-10-09T09:06:18Z","timestamp":1570611978000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/978-3-319-73830-7_1"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2018]]},"ISBN":["9783319738291","9783319738307"],"references-count":16,"URL":"https:\/\/doi.org\/10.1007\/978-3-319-73830-7_1","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[2018]]}}}