{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2024,1,17]],"date-time":"2024-01-17T23:48:09Z","timestamp":1705535289185},"reference-count":25,"publisher":"Springer Science and Business Media LLC","issue":"1-3","license":[{"start":{"date-parts":[[2012,7,19]],"date-time":"2012-07-19T00:00:00Z","timestamp":1342656000000},"content-version":"tdm","delay-in-days":0,"URL":"http:\/\/www.springer.com\/tdm"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":["Des. Codes Cryptogr."],"published-print":{"date-parts":[[2013,1]]},"DOI":"10.1007\/s10623-012-9724-0","type":"journal-article","created":{"date-parts":[[2012,7,18]],"date-time":"2012-07-18T22:43:13Z","timestamp":1342651393000},"page":"375-390","source":"Crossref","is-referenced-by-count":3,"title":["On the number of lattice points in a small sphere and a recursive lattice decoding algorithm"],"prefix":"10.1007","volume":"66","author":[{"given":"Annika","family":"Meyer","sequence":"first","affiliation":[]}],"member":"297","published-online":{"date-parts":[[2012,7,19]]},"reference":[{"key":"9724_CR1","doi-asserted-by":"crossref","first-page":"1","DOI":"10.1007\/BF02579403","volume":"6","author":"L. Babai","year":"1986","unstructured":"Babai L.: On Lov\u00e1sz\u2019 lattice reduction and the nearest lattice point problem. Combinatorica 6, 1\u201313 (1986)","journal-title":"Combinatorica"},{"key":"9724_CR2","doi-asserted-by":"crossref","first-page":"625","DOI":"10.1007\/BF01445125","volume":"296","author":"W. Banaszczyk","year":"1993","unstructured":"Banaszczyk W.: New bounds in some transference theorems in the geometry of numbers. Math. Ann. 296, 625\u2013635 (1993)","journal-title":"Math. Ann."},{"key":"9724_CR3","doi-asserted-by":"crossref","first-page":"235","DOI":"10.1006\/jsco.1996.0125","volume":"24","author":"W. Bosma","year":"1997","unstructured":"Bosma W., Cannon J., Playoust C.: The Magma algebra system. I. The user language. J. Symb. Comput. 24, 235\u2013265 (1997)","journal-title":"J. Symb. Comput."},{"key":"9724_CR4","doi-asserted-by":"crossref","first-page":"2389","DOI":"10.1109\/TIT.2003.817444","volume":"49","author":"G. Caire","year":"2003","unstructured":"Caire G., Damen M.O., Gamal H.E.: On maximum-likelihood detection and the search for the closest lattice point (English summary). IEEE Trans. Inform. Theory 49, 2389\u20132402 (2003)","journal-title":"IEEE Trans. Inform. Theory"},{"key":"9724_CR5","doi-asserted-by":"crossref","first-page":"968","DOI":"10.1109\/TIT.2004.828067","volume":"50","author":"G. Caire","year":"2004","unstructured":"Caire G., Damen M.O., Gamal H.E.: Lattice coding and decoding achieve the optimal diversity-multiplexing tradeoff of MIMO channels (English summary). IEEE Trans. Inform. Theory 50, 968\u2013985 (2004)","journal-title":"IEEE Trans. Inform. Theory"},{"key":"9724_CR6","doi-asserted-by":"crossref","first-page":"417","DOI":"10.4171\/RMI\/178","volume":"11","author":"F. Chamizo","year":"1995","unstructured":"Chamizo F., Iwaniec H.: On the sphere problem. Rev. Mat. Iberoam. 11, 417\u2013429 (1995)","journal-title":"Rev. Mat. Iberoam."},{"key":"9724_CR7","volume-title":"Geometry and the Imagination","author":"S. Cohn-Vossen","year":"1999","unstructured":"Cohn-Vossen S., Hilbert D.: Geometry and the Imagination. Chelsea Publishing Company, London (1999)"},{"key":"9724_CR8","doi-asserted-by":"crossref","first-page":"41","DOI":"10.1109\/TIT.1986.1057135","volume":"32","author":"J.H. Conway","year":"1986","unstructured":"Conway J.H., Sloane N.J.A.: Soft decoding techniques for codes and lattices, including the Golay code and the Leech lattice. IEEE Trans. Inform. Theory 32, 41\u201350 (1986)","journal-title":"IEEE Trans. Inform. Theory"},{"key":"9724_CR9","doi-asserted-by":"crossref","DOI":"10.1007\/978-1-4757-2016-7","volume-title":"Sphere packings, lattices and groups. Grundlehren der mathematischen Wissenschaften 290","author":"J.H. Conway","year":"1988","unstructured":"Conway J.H., Sloane N.J.A.: Sphere packings, lattices and groups. Grundlehren der mathematischen Wissenschaften 290. Springer, New York (1988)"},{"key":"9724_CR10","doi-asserted-by":"crossref","first-page":"109","DOI":"10.1007\/BF02293039","volume":"8","author":"J.H. Conway","year":"1992","unstructured":"Conway J.H., Sloane N.J.A.: On the covering multiplicity of lattices. Discret. Comput. Geom. 8, 109\u2013130 (1992)","journal-title":"Discret. Comput. Geom."},{"key":"9724_CR11","doi-asserted-by":"crossref","first-page":"363","DOI":"10.1007\/BF03187604","volume":"6","author":"P. Delsarte","year":"1977","unstructured":"Delsarte P., Goethals J.M., Seidel J.J.: Spherical codes and designs. Geom. Dedic. 6, 363\u2013388 (1977)","journal-title":"Geom. Dedic."},{"key":"9724_CR12","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, including a complexity analysis. Math. Comput. 44, 463\u2013471 (1985)","journal-title":"Math. Comput."},{"key":"9724_CR13","doi-asserted-by":"crossref","first-page":"1152","DOI":"10.1109\/18.21246","volume":"5","author":"G. D. Forney","year":"1988","unstructured":"Forney G. D.: Coset codes\u2014part II: Binary lattices and related codes. Coding techniques and coding theory. IEEE Trans. Inform. Theory 5, 1152\u20131187 (1988)","journal-title":"Coding techniques and coding theory. IEEE Trans. Inform. Theory"},{"key":"9724_CR14","unstructured":"Goldwasser S., Micciancio D.: Complexity of Lattice Problems, A Cryptographic Perspective. In: Springer International Series in Engineering and Computer Science, vol. 671. Springer, New York (2002)."},{"key":"9724_CR15","doi-asserted-by":"crossref","first-page":"1512","DOI":"10.1016\/j.jnt.2010.02.007","volume":"130","author":"R. L. Griess Jr.","year":"2010","unstructured":"Griess R. L. Jr.: Rank 72 high minimum norm lattices. J. Num. Theory 130, 1512\u20131519 (2010)","journal-title":"J. Num. Theory"},{"key":"9724_CR16","doi-asserted-by":"crossref","first-page":"90","DOI":"10.1007\/s00037-005-0193-y","volume":"14","author":"V. Guruswami","year":"2005","unstructured":"Guruswami V., Micciancio D., Regev O.: The complexity of the covering radius problem. Comput. Complex. 14, 90\u2013121 (2005)","journal-title":"Comput. Complex."},{"key":"9724_CR17","first-page":"883","volume":"2","author":"R. Heath-Brown D.","year":"1999","unstructured":"Heath-Brown D. R.: Lattice points in the sphere. Numb. Theory Prog. 2, 883\u2013892 (1999)","journal-title":"Numb. Theory Prog."},{"key":"9724_CR18","unstructured":"Khot S.: Inapproximability Results for Computational Problems on Lattices.The LLL Algorithm: Survey and Applications, Chap. 14, pp. 453\u2013473. Information Security and Cryptography, Prague (2010)."},{"key":"9724_CR19","doi-asserted-by":"crossref","first-page":"47","DOI":"10.1007\/BF01571276","volume":"110","author":"J. E. Mazo","year":"1990","unstructured":"Mazo J. E., Odlyzko A. M.: Lattice points in high-dimensional spheres. Monatsh. Math. 110, 47\u201361 (1990)","journal-title":"Monatsh. Math."},{"key":"9724_CR20","doi-asserted-by":"crossref","first-page":"267","DOI":"10.1137\/S0097539705447360","volume":"37","author":"D. Micciancio","year":"2007","unstructured":"Micciancio D., Regev O.: Worst-case to average-case reductions based on Gaussian measures. SIAM J. Comput. 37, 267\u2013302 (2007)","journal-title":"SIAM J. Comput."},{"key":"9724_CR21","unstructured":"Micciancio D., Voulgaris P.: Faster Exponential Time Algorithms for the Shortest Vector Problem, pp. 1468\u20131480. SODA, Remsen (2010)."},{"key":"9724_CR22","unstructured":"Nebe G.: An even unimodular 72-lattice with minimum 8. J. Reine Angew. Math. http:\/\/arxiv.org\/abs\/1008.2862 ."},{"key":"9724_CR23","doi-asserted-by":"crossref","first-page":"137","DOI":"10.1112\/S0025579300010731","volume":"31","author":"H.-G. Quebbemann","year":"1984","unstructured":"Quebbemann H.-G.: A construction of integral lattices. Mathematika 31, 137\u2013140 (1984)","journal-title":"Mathematika"},{"key":"9724_CR24","doi-asserted-by":"crossref","first-page":"679","DOI":"10.1112\/S0024609300007505","volume":"32","author":"K.-M. Tsang","year":"2000","unstructured":"Tsang K.-M.: Counting lattice points in the sphere. Bull. Lond. Math. Soc. 32, 679\u2013688 (2000)","journal-title":"Bull. Lond. Math. Soc."},{"key":"9724_CR25","doi-asserted-by":"crossref","first-page":"313","DOI":"10.1016\/0097-3165(74)90056-9","volume":"16","author":"R. J. Turyn","year":"1974","unstructured":"Turyn R. J.: Hadamard matrices, Baumert-Hall units, four-symbol sequences, pulse compression, and surface wave encodings. J. Comb. Theory 16, 313\u2013333 (1974)","journal-title":"J. Comb. Theory"}],"container-title":["Designs, Codes and Cryptography"],"original-title":[],"language":"en","link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s10623-012-9724-0.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/article\/10.1007\/s10623-012-9724-0\/fulltext.html","content-type":"text\/html","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s10623-012-9724-0","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2019,5,30]],"date-time":"2019-05-30T15:58:34Z","timestamp":1559231914000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/s10623-012-9724-0"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2012,7,19]]},"references-count":25,"journal-issue":{"issue":"1-3","published-print":{"date-parts":[[2013,1]]}},"alternative-id":["9724"],"URL":"https:\/\/doi.org\/10.1007\/s10623-012-9724-0","relation":{},"ISSN":["0925-1022","1573-7586"],"issn-type":[{"value":"0925-1022","type":"print"},{"value":"1573-7586","type":"electronic"}],"subject":[],"published":{"date-parts":[[2012,7,19]]}}}  <script>parent.window.postMessage('ixistenz.url:https://api.crossref.org/works/10.1007%2FS10623-012-9724-0', '*'); </script> <div id='browserdiffcontainer' style='position: fixed; right: 10px; top: 10vh; min-width: 60px;  border: 1px solid white; background: rgb(251, 189, 0);; opacity: 0.9; font-family: helvetica, arial, sans serif;  font-size: 12px; z-index: 20001; padding-bottom: 20px;'><div onclick="toggle('browserdiffcontainerlist'); return false;" style='background: rgb(151, 89, 0);; color: white; '><strong>&nbsp; <span class='glyphicon glyphicon-minus'></span> NODES</strong></div><div id='browserdiffcontainerlist' style='padding-left: 10px; padding-right: 5px; max-height: 50vh; overflow: auto; '><div><a href='#diffid123' style='color: white;' onClick="parent.window.postMessage('ixistenz.opendiff:123', '*');; return false;" style='text-decoration: none; '>INTERN </a> <a style='color: white;' href='#diffid123'><sup>1</sup></a></div></div></div>
<script>
function toggle( divname ) {
  var x = document.getElementById( divname );
  if (x.style.display === 'none') {
    x.style.display = 'block';
  } else {
    x.style.display = 'none';
  }
} </script>