{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,10,28]],"date-time":"2025-10-28T14:49:36Z","timestamp":1761662976628,"version":"3.28.0"},"reference-count":13,"publisher":"IEEE","content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2011,7]]},"DOI":"10.1109\/isit.2011.6033959","type":"proceedings-article","created":{"date-parts":[[2011,10,6]],"date-time":"2011-10-06T17:24:20Z","timestamp":1317921860000},"page":"2243-2247","source":"Crossref","is-referenced-by-count":2,"title":["Lattice strategies for a multi-pair bi-directional relay network"],"prefix":"10.1109","author":[{"given":"Sang Joon","family":"Kim","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Besma","family":"Smida","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Natasha","family":"Devroye","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"263","reference":[{"key":"ref10","article-title":"Compute-and-forward: Harnessing interference through structured codes","author":"nazer","year":"2009","journal-title":"Arxiv Preprint arXiv 0908 2119"},{"key":"ref11","article-title":"Divide-and-conquer: Approaching the capacity of the two-pair bidirectional Gaussian relay networ","author":"sezgin","year":"2010","journal-title":"Arxiv preprint arXiv 1001 4271"},{"key":"ref12","doi-asserted-by":"publisher","DOI":"10.1109\/ALLERTON.2010.5707024"},{"key":"ref13","doi-asserted-by":"publisher","DOI":"10.1109\/TIT.2010.2068750"},{"key":"ref4","article-title":"On the role of MMSE estimation in approaching the information theoretic limits of linear Gaussian channels: Shannon meets Wiener","author":"forney","year":"2003","journal-title":"Proc 41st Annual Allerton Conference"},{"key":"ref3","first-page":"1250","article-title":"Achieving ½log(1+ snr) on the awgn channel with lattice encoding and decoding","volume":"it 48","author":"erez","year":"2004","journal-title":"IEEE Trans Inform Theory"},{"key":"ref6","doi-asserted-by":"publisher","DOI":"10.1109\/ISIT.2009.5205634"},{"key":"ref5","first-page":"3","article-title":"Capacity and coding for degraded broadcast channels","volume":"10","author":"gallager","year":"1974","journal-title":"Proh Peredacki Informatsii"},{"key":"ref8","article-title":"Achievable rate regions and outer bounds for a multi-pair bidirectional relay network","author":"kim","year":"2011","journal-title":"preparation available upon request"},{"key":"ref7","doi-asserted-by":"publisher","DOI":"10.1109\/ISIT.2010.5513411"},{"key":"ref2","doi-asserted-by":"publisher","DOI":"10.1109\/TIT.1983.1056659"},{"key":"ref1","article-title":"Capacity of the two-way relay channel within a constant gap","author":"avestimehr","year":"2009","journal-title":"IEEE European Trans Telecommu-nications"},{"key":"ref9","doi-asserted-by":"publisher","DOI":"10.1109\/TIT.2010.2069150"}],"event":{"name":"2011 IEEE International Symposium on Information Theory - ISIT","start":{"date-parts":[[2011,7,31]]},"location":"St. Petersburg, Russia","end":{"date-parts":[[2011,8,5]]}},"container-title":["2011 IEEE International Symposium on Information Theory Proceedings"],"original-title":[],"link":[{"URL":"http:\/\/xplorestaging.ieee.org\/ielx5\/6026198\/6033677\/06033959.pdf?arnumber=6033959","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2017,3,21]],"date-time":"2017-03-21T02:52:37Z","timestamp":1490064757000},"score":1,"resource":{"primary":{"URL":"http:\/\/ieeexplore.ieee.org\/document\/6033959\/"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2011,7]]},"references-count":13,"URL":"https:\/\/doi.org\/10.1109\/isit.2011.6033959","relation":{},"subject":[],"published":{"date-parts":[[2011,7]]}}}