{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2024,10,23]],"date-time":"2024-10-23T04:45:11Z","timestamp":1729658711117,"version":"3.28.0"},"reference-count":18,"publisher":"IEEE","content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2017,6]]},"DOI":"10.1109\/isit.2017.8006847","type":"proceedings-article","created":{"date-parts":[[2017,8,29]],"date-time":"2017-08-29T14:54:37Z","timestamp":1504018477000},"page":"1838-1842","source":"Crossref","is-referenced-by-count":5,"title":["On the communication cost of determining an approximate nearest lattice point"],"prefix":"10.1109","author":[{"given":"Maiara F.","family":"Bollauf","sequence":"first","affiliation":[]},{"given":"Vinay A.","family":"Vaishampayan","sequence":"additional","affiliation":[]},{"given":"Sueli I. R.","family":"Costa","sequence":"additional","affiliation":[]}],"member":"263","reference":[{"key":"ref10","doi-asserted-by":"publisher","DOI":"10.1007\/BF01457454"},{"key":"ref11","doi-asserted-by":"publisher","DOI":"10.1109\/TIT.2011.2161916"},{"key":"ref12","first-page":"278297","article-title":"On the positive quadratic forms and on continued fractions algorithms (Über die positiven quadratischen formen undüber kettenbruchähnliche algorithmen)","volume":"107","author":"minkowski","year":"1891","journal-title":"J Reine und Angewandte Math"},{"key":"ref13","doi-asserted-by":"publisher","DOI":"10.1109\/18.915643"},{"key":"ref14","doi-asserted-by":"publisher","DOI":"10.1145\/1089242.1089247"},{"key":"ref15","doi-asserted-by":"publisher","DOI":"10.1109\/ACSSC.2009.5470211"},{"key":"ref16","doi-asserted-by":"publisher","DOI":"10.1002\/j.1538-7305.1948.tb01338.x"},{"key":"ref17","doi-asserted-by":"publisher","DOI":"10.1109\/ISIT.2017.8006848"},{"key":"ref18","doi-asserted-by":"publisher","DOI":"10.1145\/800135.804414"},{"journal-title":"Rate Distortion Theory A Mathematical Basis for Data Compression","year":"1971","author":"berger","key":"ref4"},{"key":"ref3","doi-asserted-by":"publisher","DOI":"10.1007\/BF02579403"},{"key":"ref6","doi-asserted-by":"publisher","DOI":"10.1017\/CBO9781139012843"},{"key":"ref5","doi-asserted-by":"crossref","DOI":"10.1007\/978-1-4757-6568-7","author":"conway","year":"1999","journal-title":"Sphere Packings Lattices and Groups"},{"key":"ref8","doi-asserted-by":"publisher","DOI":"10.1145\/1142473.1142507"},{"journal-title":"An Introduction to Mathematical Cryptography","year":"2008","author":"hoffstein","key":"ref7"},{"key":"ref2","doi-asserted-by":"publisher","DOI":"10.1109\/TIT.2010.2080850"},{"key":"ref1","doi-asserted-by":"publisher","DOI":"10.1109\/TIT.2002.800499"},{"journal-title":"Communication Complexity","year":"1997","author":"kushilevitz","key":"ref9"}],"event":{"name":"2017 IEEE International Symposium on Information Theory (ISIT)","start":{"date-parts":[[2017,6,25]]},"location":"Aachen, Germany","end":{"date-parts":[[2017,6,30]]}},"container-title":["2017 IEEE International Symposium on Information Theory (ISIT)"],"original-title":[],"link":[{"URL":"http:\/\/xplorestaging.ieee.org\/ielx7\/7999336\/8006474\/08006847.pdf?arnumber=8006847","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2019,10,2]],"date-time":"2019-10-02T18:20:44Z","timestamp":1570040444000},"score":1,"resource":{"primary":{"URL":"http:\/\/ieeexplore.ieee.org\/document\/8006847\/"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2017,6]]},"references-count":18,"URL":"https:\/\/doi.org\/10.1109\/isit.2017.8006847","relation":{},"subject":[],"published":{"date-parts":[[2017,6]]}}}