{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,3,31]],"date-time":"2026-03-31T21:04:28Z","timestamp":1774991068912,"version":"3.50.1"},"reference-count":16,"publisher":"IEEE","license":[{"start":{"date-parts":[[2016,7,1]],"date-time":"2016-07-01T00:00:00Z","timestamp":1467331200000},"content-version":"stm-asf","delay-in-days":0,"URL":"https:\/\/doi.org\/10.15223\/policy-029"},{"start":{"date-parts":[[2016,7,1]],"date-time":"2016-07-01T00:00:00Z","timestamp":1467331200000},"content-version":"stm-asf","delay-in-days":0,"URL":"https:\/\/doi.org\/10.15223\/policy-037"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2016,7]]},"DOI":"10.1109\/isit.2016.7541634","type":"proceedings-article","created":{"date-parts":[[2016,8,15]],"date-time":"2016-08-15T18:52:57Z","timestamp":1471287177000},"page":"1924-1928","source":"Crossref","is-referenced-by-count":0,"title":["Further results on independent Metropolis-Hastings-Klein sampling"],"prefix":"10.1109","author":[{"given":"Zheng","family":"Wang","sequence":"first","affiliation":[{"name":"Department of EEE, Imperial College London, SW7 2AZ, United Kingdom"}]},{"given":"Cong","family":"Ling","sequence":"additional","affiliation":[{"name":"Department of EEE, Imperial College London, SW7 2AZ, United Kingdom"}]}],"member":"263","reference":[{"key":"ref10","doi-asserted-by":"publisher","DOI":"10.1109\/ISIT.2015.7282900"},{"key":"ref11","doi-asserted-by":"publisher","DOI":"10.1007\/BF00162521"},{"key":"ref12","doi-asserted-by":"publisher","DOI":"10.1090\/mbk\/058"},{"key":"ref13","article-title":"On the geometric ergodicity of Metropolis-Hastings algorithms for lattice Gaussian sampling","author":"wang","year":"0","journal-title":"Submitted to IEEE Transactionson information Theory 2015"},{"key":"ref14","doi-asserted-by":"publisher","DOI":"10.1109\/FOCS.2004.72"},{"key":"ref15","author":"conway","year":"1998","journal-title":"Sphere Packings Lattices and Groups"},{"key":"ref16","doi-asserted-by":"publisher","DOI":"10.1007\/BF01445125"},{"key":"ref4","doi-asserted-by":"publisher","DOI":"10.1109\/TSP.2014.2334558"},{"key":"ref3","doi-asserted-by":"publisher","DOI":"10.1109\/TCOMM.2013.101813.130500"},{"key":"ref6","doi-asserted-by":"publisher","DOI":"10.1109\/TSP.2006.872539"},{"key":"ref5","doi-asserted-by":"publisher","DOI":"10.1109\/TVT.2013.2260572"},{"key":"ref8","doi-asserted-by":"publisher","DOI":"10.1109\/TWC.2007.05453"},{"key":"ref7","doi-asserted-by":"crossref","first-page":"255","DOI":"10.1109\/78.978381","article-title":"Convergence analysis and comparisons of Markov chain Monte Carlo algorithms in digital communications","volume":"50","author":"chen","year":"2002","journal-title":"IEEE Trans on Signal Process"},{"key":"ref2","doi-asserted-by":"publisher","DOI":"10.1109\/TIT.2011.2162180"},{"key":"ref1","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":"ref9","doi-asserted-by":"publisher","DOI":"10.1109\/LSP.2005.855558"}],"event":{"name":"2016 IEEE International Symposium on Information Theory (ISIT)","location":"Barcelona, Spain","start":{"date-parts":[[2016,7,10]]},"end":{"date-parts":[[2016,7,15]]}},"container-title":["2016 IEEE International Symposium on Information Theory (ISIT)"],"original-title":[],"link":[{"URL":"http:\/\/xplorestaging.ieee.org\/ielx7\/7532279\/7541040\/07541634.pdf?arnumber=7541634","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2026,3,31]],"date-time":"2026-03-31T19:53:12Z","timestamp":1774986792000},"score":1,"resource":{"primary":{"URL":"https:\/\/ieeexplore.ieee.org\/document\/7541634\/"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2016,7]]},"references-count":16,"URL":"https:\/\/doi.org\/10.1109\/isit.2016.7541634","relation":{},"subject":[],"published":{"date-parts":[[2016,7]]}}}