{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,12,26]],"date-time":"2025-12-26T07:12:21Z","timestamp":1766733141312,"version":"3.28.0"},"reference-count":20,"publisher":"IEEE","content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2014,9]]},"DOI":"10.1109\/allerton.2014.7028460","type":"proceedings-article","created":{"date-parts":[[2015,2,5]],"date-time":"2015-02-05T19:24:07Z","timestamp":1423164247000},"page":"227-233","source":"Crossref","is-referenced-by-count":22,"title":["Compute-and-Forward: Finding the best equation"],"prefix":"10.1109","author":[{"given":"Saeid","family":"Sahraei","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Michael","family":"Gastpar","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"263","reference":[{"doi-asserted-by":"publisher","key":"19","DOI":"10.1137\/120872516"},{"doi-asserted-by":"publisher","key":"17","DOI":"10.1109\/TIT.2009.2039090"},{"doi-asserted-by":"publisher","key":"18","DOI":"10.1109\/ISIT.2009.5205264"},{"doi-asserted-by":"publisher","key":"15","DOI":"10.1109\/ISIT.2014.6875243"},{"doi-asserted-by":"publisher","key":"16","DOI":"10.1109\/ISITA.2008.4895596"},{"doi-asserted-by":"publisher","key":"13","DOI":"10.1049\/iet-com.2013.0324"},{"doi-asserted-by":"publisher","key":"14","DOI":"10.1109\/PIMRC.2012.6362889"},{"doi-asserted-by":"publisher","key":"11","DOI":"10.1098\/rspa.1992.0004"},{"doi-asserted-by":"publisher","key":"12","DOI":"10.1109\/ISIT.2012.6283833"},{"doi-asserted-by":"publisher","key":"3","DOI":"10.1109\/TIT.2010.2068750"},{"doi-asserted-by":"publisher","key":"20","DOI":"10.1007\/BF02294158"},{"doi-asserted-by":"publisher","key":"2","DOI":"10.1109\/IZS.2008.4497296"},{"doi-asserted-by":"publisher","key":"1","DOI":"10.1109\/TIT.2011.2165816"},{"key":"10","doi-asserted-by":"crossref","DOI":"10.1007\/978-1-4757-6568-7","volume":"290","author":"conway","year":"1999","journal-title":"Sphere Packings Lattices and Groups"},{"doi-asserted-by":"publisher","key":"7","DOI":"10.1109\/FOCS.2011.31"},{"doi-asserted-by":"publisher","key":"6","DOI":"10.1109\/FOCS.2004.31"},{"doi-asserted-by":"publisher","key":"5","DOI":"10.1145\/1374376.1374408"},{"doi-asserted-by":"publisher","key":"4","DOI":"10.1007\/BF01457454"},{"key":"9","first-page":"216","article-title":"Hardness of approximating the closest vector problem with preprocessing","author":"alekhnovich","year":"2005","journal-title":"Foundations of Computer Science 2005 FOCS 2005 46th Annual IEEE Symposium on"},{"doi-asserted-by":"publisher","key":"8","DOI":"10.1137\/1.9781611973105.79"}],"event":{"name":"2014 52nd Annual Allerton Conference on Communication, Control, and Computing (Allerton)","start":{"date-parts":[[2014,9,30]]},"location":"Monticello, IL, USA","end":{"date-parts":[[2014,10,3]]}},"container-title":["2014 52nd Annual Allerton Conference on Communication, Control, and Computing (Allerton)"],"original-title":[],"link":[{"URL":"http:\/\/xplorestaging.ieee.org\/ielx7\/7008053\/7028426\/07028460.pdf?arnumber=7028460","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2017,6,23]],"date-time":"2017-06-23T05:02:25Z","timestamp":1498194145000},"score":1,"resource":{"primary":{"URL":"http:\/\/ieeexplore.ieee.org\/document\/7028460\/"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2014,9]]},"references-count":20,"URL":"https:\/\/doi.org\/10.1109\/allerton.2014.7028460","relation":{},"subject":[],"published":{"date-parts":[[2014,9]]}}}