{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2024,10,23]],"date-time":"2024-10-23T07:58:44Z","timestamp":1729670324719,"version":"3.28.0"},"reference-count":19,"publisher":"IEEE","content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2015,6]]},"DOI":"10.1109\/isit.2015.7282900","type":"proceedings-article","created":{"date-parts":[[2015,10,1]],"date-time":"2015-10-01T18:09:52Z","timestamp":1443722992000},"page":"2470-2474","source":"Crossref","is-referenced-by-count":2,"title":["Independent Metropolis-Hastings-Klein algorithm for lattice Gaussian sampling"],"prefix":"10.1109","author":[{"given":"Zheng","family":"Wang","sequence":"first","affiliation":[]},{"given":"Cong","family":"Ling","sequence":"additional","affiliation":[]}],"member":"263","reference":[{"key":"ref10","first-page":"937","article-title":"Finding the closest lattice vector when it is unusually close","author":"klein","year":"2000","journal-title":"5th ACM-SIAM Symp Discrete Algorithms"},{"key":"ref11","doi-asserted-by":"publisher","DOI":"10.1145\/1374376.1374407"},{"key":"ref12","doi-asserted-by":"publisher","DOI":"10.1109\/ISIT.2014.6875081"},{"key":"ref13","doi-asserted-by":"publisher","DOI":"10.1093\/biomet\/57.1.97"},{"key":"ref14","doi-asserted-by":"publisher","DOI":"10.1017\/CBO9780511626630"},{"key":"ref15","doi-asserted-by":"crossref","DOI":"10.1090\/mbk\/058","author":"levin","year":"2008","journal-title":"Markov Chains and Mixing Times"},{"key":"ref16","doi-asserted-by":"publisher","DOI":"10.1214\/aos\/1176325750"},{"key":"ref17","doi-asserted-by":"crossref","first-page":"20","DOI":"10.1214\/154957804100000024","article-title":"General state space Markov chains and MCMC algorithms","volume":"1","author":"roberts","year":"2004","journal-title":"Probability Surveys"},{"journal-title":"Sphere Packings Lattices and Groups","year":"1998","author":"conway","key":"ref18"},{"key":"ref19","article-title":"Lattice codes for the wiretap Gaussian channel: Construction and analysis","author":"oggier","year":"2013","journal-title":"submitted to IEEE Trans In-form Theory"},{"key":"ref4","doi-asserted-by":"publisher","DOI":"10.1109\/TIT.2014.2332343"},{"key":"ref3","doi-asserted-by":"publisher","DOI":"10.1109\/18.256499"},{"key":"ref6","doi-asserted-by":"crossref","first-page":"372","DOI":"10.1109\/FOCS.2004.72","article-title":"Worst-case to average-case reuctions based on Gaussian measures","author":"micciancio","year":"2004","journal-title":"Proc Ann Symp Found Computer Science"},{"key":"ref5","doi-asserted-by":"publisher","DOI":"10.1109\/TIT.2014.2343226"},{"key":"ref8","doi-asserted-by":"publisher","DOI":"10.1109\/TIT.2011.2162180"},{"key":"ref7","doi-asserted-by":"publisher","DOI":"10.1145\/1536414.1536440"},{"key":"ref2","doi-asserted-by":"publisher","DOI":"10.1109\/49.29616"},{"key":"ref1","doi-asserted-by":"publisher","DOI":"10.1007\/BF01445125"},{"key":"ref9","doi-asserted-by":"publisher","DOI":"10.1109\/TCOMM.2013.101813.130500"}],"event":{"name":"2015 IEEE International Symposium on Information Theory (ISIT)","start":{"date-parts":[[2015,6,14]]},"location":"Hong Kong, Hong Kong","end":{"date-parts":[[2015,6,19]]}},"container-title":["2015 IEEE International Symposium on Information Theory (ISIT)"],"original-title":[],"link":[{"URL":"http:\/\/xplorestaging.ieee.org\/ielx7\/7270906\/7282397\/07282900.pdf?arnumber=7282900","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2020,9,8]],"date-time":"2020-09-08T23:24:36Z","timestamp":1599607476000},"score":1,"resource":{"primary":{"URL":"http:\/\/ieeexplore.ieee.org\/document\/7282900\/"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2015,6]]},"references-count":19,"URL":"https:\/\/doi.org\/10.1109\/isit.2015.7282900","relation":{},"subject":[],"published":{"date-parts":[[2015,6]]}}}