{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,2,28]],"date-time":"2026-02-28T12:59:43Z","timestamp":1772283583557,"version":"3.50.1"},"reference-count":38,"publisher":"Institute of Electrical and Electronics Engineers (IEEE)","issue":"3","license":[{"start":{"date-parts":[[2010,3,1]],"date-time":"2010-03-01T00:00:00Z","timestamp":1267401600000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/ieeexplore.ieee.org\/Xplorehelp\/downloads\/license-information\/IEEE.html"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":["IEEE Trans. Inform. Theory"],"published-print":{"date-parts":[[2010,3]]},"DOI":"10.1109\/tit.2009.2039090","type":"journal-article","created":{"date-parts":[[2010,3,12]],"date-time":"2010-03-12T21:09:58Z","timestamp":1268428198000},"page":"1015-1022","source":"Crossref","is-referenced-by-count":17,"title":["Linear-Time Nearest Point Algorithms for Coxeter Lattices"],"prefix":"10.1109","volume":"56","author":[{"given":"Robby G.","family":"McKilliam","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Warren D.","family":"Smith","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"I. Vaughan L.","family":"Clarkson","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"263","reference":[{"key":"ref38","doi-asserted-by":"publisher","DOI":"10.2307\/2974444"},{"key":"ref33","author":"cormen","year":"2001","journal-title":"Introduction to Algorithms"},{"key":"ref32","doi-asserted-by":"publisher","DOI":"10.1109\/ACSSC.2007.4487281"},{"key":"ref31","doi-asserted-by":"publisher","DOI":"10.1109\/ICASSP.1999.756296"},{"key":"ref30","doi-asserted-by":"publisher","DOI":"10.1109\/18.32144"},{"key":"ref37","volume":"2","author":"knuth","year":"1997","journal-title":"The art of computer programming"},{"key":"ref36","doi-asserted-by":"publisher","DOI":"10.1145\/360680.360691"},{"key":"ref35","doi-asserted-by":"publisher","DOI":"10.1145\/360680.360694"},{"key":"ref34","doi-asserted-by":"publisher","DOI":"10.1016\/S0022-0000(73)80033-9"},{"key":"ref10","doi-asserted-by":"publisher","DOI":"10.1109\/ICASSP.2009.4960121"},{"key":"ref11","doi-asserted-by":"publisher","DOI":"10.1109\/ICASSP.2008.4518455"},{"key":"ref12","doi-asserted-by":"publisher","DOI":"10.1109\/TIT.1982.1056484"},{"key":"ref13","doi-asserted-by":"publisher","DOI":"10.1109\/18.915688"},{"key":"ref14","author":"van emde boas","year":"1981","journal-title":"Another NP-complete partition problem and the complexity of computing short vectors in a lattice"},{"key":"ref15","doi-asserted-by":"publisher","DOI":"10.1109\/TIT.2002.800499"},{"key":"ref16","doi-asserted-by":"publisher","DOI":"10.1109\/18.771234"},{"key":"ref17","doi-asserted-by":"publisher","DOI":"10.1145\/1089242.1089247"},{"key":"ref18","doi-asserted-by":"publisher","DOI":"10.1287\/moor.12.3.415"},{"key":"ref19","doi-asserted-by":"publisher","DOI":"10.1109\/TIT.1986.1057135"},{"key":"ref28","doi-asserted-by":"publisher","DOI":"10.1109\/TIT.1982.1056483"},{"key":"ref4","doi-asserted-by":"publisher","DOI":"10.1145\/258533.258604"},{"key":"ref27","doi-asserted-by":"publisher","DOI":"10.1109\/18.21246"},{"key":"ref3","first-page":"99","article-title":"generating hard instances of lattice problems","author":"ajtai","year":"1996","journal-title":"Proc 28th ACM Symp Theory Computing"},{"key":"ref6","doi-asserted-by":"publisher","DOI":"10.1109\/TCOMM.2009.09.080041"},{"key":"ref29","doi-asserted-by":"publisher","DOI":"10.1109\/76.981845"},{"key":"ref5","doi-asserted-by":"publisher","DOI":"10.1109\/TIT.2003.809506"},{"key":"ref8","doi-asserted-by":"publisher","DOI":"10.1109\/TSP.2010.2045786"},{"key":"ref7","doi-asserted-by":"publisher","DOI":"10.1109\/TSP.2009.2026511"},{"key":"ref2","author":"conway","year":"1998","journal-title":"Sphere Packings Lattices and Groups"},{"key":"ref9","doi-asserted-by":"publisher","DOI":"10.1109\/TSP.2007.912268"},{"key":"ref1","doi-asserted-by":"crossref","first-page":"104","DOI":"10.1007\/3-540-46796-3_11","volume":"1719","author":"clarkson","year":"1999","journal-title":"Applied Algebra Algebraic Algorithms and Error-Correcting Codes"},{"key":"ref20","doi-asserted-by":"publisher","DOI":"10.1109\/TIT.2008.928280"},{"key":"ref22","doi-asserted-by":"publisher","DOI":"10.4153\/CJM-1951-045-8"},{"key":"ref21","article-title":"a linear-time nearest point algorithm for the lattice <formula formulatype=\"inline\"><tex notation=\"tex\">${a}_{n}^{\\ast }$<\/tex><\/formula>","author":"mckilliam","year":"2008","journal-title":"Int Symp Inf Theory and its Appl"},{"key":"ref24","doi-asserted-by":"publisher","DOI":"10.1109\/PROC.1986.13542"},{"key":"ref23","doi-asserted-by":"crossref","DOI":"10.1007\/978-3-662-05167-2","author":"martinet","year":"2003","journal-title":"Perfect Lattices in Euclidean Spaces"},{"key":"ref26","doi-asserted-by":"publisher","DOI":"10.1109\/18.21245"},{"key":"ref25","doi-asserted-by":"publisher","DOI":"10.1109\/TIT.1987.1057329"}],"container-title":["IEEE Transactions on Information Theory"],"original-title":[],"link":[{"URL":"http:\/\/xplorestaging.ieee.org\/ielx5\/18\/5429092\/05429109.pdf?arnumber=5429109","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2021,10,11]],"date-time":"2021-10-11T00:47:41Z","timestamp":1633913261000},"score":1,"resource":{"primary":{"URL":"http:\/\/ieeexplore.ieee.org\/document\/5429109\/"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2010,3]]},"references-count":38,"journal-issue":{"issue":"3"},"URL":"https:\/\/doi.org\/10.1109\/tit.2009.2039090","relation":{},"ISSN":["0018-9448","1557-9654"],"issn-type":[{"value":"0018-9448","type":"print"},{"value":"1557-9654","type":"electronic"}],"subject":[],"published":{"date-parts":[[2010,3]]}}}