{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2024,10,23]],"date-time":"2024-10-23T03:25:40Z","timestamp":1729653940395,"version":"3.28.0"},"reference-count":18,"publisher":"IEEE","content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2009,6]]},"DOI":"10.1109\/isit.2009.5205679","type":"proceedings-article","created":{"date-parts":[[2009,8,24]],"date-time":"2009-08-24T15:09:52Z","timestamp":1251126592000},"page":"729-733","source":"Crossref","is-referenced-by-count":4,"title":["Tail behavior of sphere-decoding complexity in random lattices"],"prefix":"10.1109","author":[{"given":"D.","family":"Seethaler","sequence":"first","affiliation":[]},{"given":"J.","family":"Jalden","sequence":"additional","affiliation":[]},{"given":"C.","family":"Studer","sequence":"additional","affiliation":[]},{"given":"H.","family":"Bolcskei","sequence":"additional","affiliation":[]}],"member":"263","reference":[{"key":"17","doi-asserted-by":"publisher","DOI":"10.1049\/el:19990058"},{"key":"18","first-page":"2953","article-title":"complex lattice reduction algorithms for low-complexity mimo detection","volume":"5","author":"gan","year":"2005","journal-title":"Proc IEEE Globecom 2005"},{"key":"15","doi-asserted-by":"publisher","DOI":"10.1109\/TIT.2003.810646"},{"key":"16","doi-asserted-by":"publisher","DOI":"10.1007\/BF01457454"},{"volume":"b","journal-title":"Handbook of Convex Geometry","year":"1993","key":"13"},{"year":"0","key":"14"},{"key":"11","doi-asserted-by":"publisher","DOI":"10.1109\/18.651011"},{"key":"12","doi-asserted-by":"publisher","DOI":"10.1109\/TIT.2011.2162177"},{"key":"3","doi-asserted-by":"publisher","DOI":"10.1109\/ICCS.1992.254963"},{"key":"2","doi-asserted-by":"publisher","DOI":"10.1090\/S0025-5718-1985-0777278-8"},{"key":"1","doi-asserted-by":"publisher","DOI":"10.1109\/TIT.2002.800499"},{"key":"10","doi-asserted-by":"crossref","DOI":"10.1007\/978-1-4757-2016-7","author":"conway","year":"1988","journal-title":"Sphere Packings Lattices and Groups"},{"key":"7","doi-asserted-by":"publisher","DOI":"10.1109\/TSP.2005.850352"},{"key":"6","doi-asserted-by":"publisher","DOI":"10.1109\/JSAC.2008.080206"},{"key":"5","doi-asserted-by":"publisher","DOI":"10.1109\/JSSC.2005.847505"},{"key":"4","first-page":"611","article-title":"a universal decoding algorithm for lattice codes","author":"viterbo","year":"1993","journal-title":"GRETSI 14-e?me Colloq"},{"key":"9","doi-asserted-by":"publisher","DOI":"10.1109\/TSP.2005.843746"},{"key":"8","doi-asserted-by":"publisher","DOI":"10.1109\/TSP.2005.850350"}],"event":{"name":"2009 IEEE International Symposium on Information Theory - ISIT","start":{"date-parts":[[2009,6,28]]},"location":"Seoul, South Korea","end":{"date-parts":[[2009,7,3]]}},"container-title":["2009 IEEE International Symposium on Information Theory"],"original-title":[],"link":[{"URL":"http:\/\/xplorestaging.ieee.org\/ielx5\/5179947\/5205248\/05205679.pdf?arnumber=5205679","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2017,6,18]],"date-time":"2017-06-18T23:05:26Z","timestamp":1497827126000},"score":1,"resource":{"primary":{"URL":"http:\/\/ieeexplore.ieee.org\/document\/5205679\/"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2009,6]]},"references-count":18,"URL":"https:\/\/doi.org\/10.1109\/isit.2009.5205679","relation":{},"subject":[],"published":{"date-parts":[[2009,6]]}}}