{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2022,3,29]],"date-time":"2022-03-29T03:22:53Z","timestamp":1648524173587},"reference-count":30,"publisher":"Institute of Electrical and Electronics Engineers (IEEE)","issue":"5","license":[{"start":{"date-parts":[[2013,5,1]],"date-time":"2013-05-01T00:00:00Z","timestamp":1367366400000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/ieeexplore.ieee.org\/Xplorehelp\/downloads\/license-information\/IEEE.html"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":["IEEE Trans. Inform. Theory"],"published-print":{"date-parts":[[2013,5]]},"DOI":"10.1109\/tit.2012.2235906","type":"journal-article","created":{"date-parts":[[2012,12,21]],"date-time":"2012-12-21T19:03:14Z","timestamp":1356116594000},"page":"2777-2793","source":"Crossref","is-referenced-by-count":2,"title":["Near-Optimal Quantization and Linear Network Coding for Relay Networks"],"prefix":"10.1109","volume":"59","author":[{"given":"Anand","family":"Muralidhar","sequence":"first","affiliation":[]},{"given":"P. R.","family":"Kumar","sequence":"additional","affiliation":[]}],"member":"263","reference":[{"key":"ref30","doi-asserted-by":"publisher","DOI":"10.1109\/TIT.2011.2173721"},{"key":"ref10","doi-asserted-by":"publisher","DOI":"10.1109\/TIT.2005.844066"},{"key":"ref11","doi-asserted-by":"publisher","DOI":"10.1109\/TIT.2005.853304"},{"key":"ref12","doi-asserted-by":"publisher","DOI":"10.1109\/TIT.2011.2119930"},{"key":"ref13","article-title":"Compress-and-forward scheme for a relay network: approximate optimality and connection to algebraic flows","author":"raja","year":"2010","journal-title":"IEEE Trans Inf Theory"},{"key":"ref14","article-title":"Capacity of multiple unicast in wireless networks: A polymatroidal approach","author":"kannan","year":"2012","journal-title":"IEEE Trans Inf Theory"},{"key":"ref15","doi-asserted-by":"publisher","DOI":"10.1145\/2090236.2090268"},{"key":"ref16","doi-asserted-by":"publisher","DOI":"10.1109\/ALLERTON.2010.5706940"},{"key":"ref17","author":"dikaliotis","year":"2011","journal-title":"Low-complexity near-optimal codes for Gaussian relay networks"},{"key":"ref18","first-page":"669","article-title":"Approximately achieving Gaussian relay network capacity with lattice codes","author":"a zgr","year":"2010","journal-title":"Proc Int Symp Inf Theory"},{"key":"ref19","doi-asserted-by":"publisher","DOI":"10.1109\/TNET.2003.818197"},{"key":"ref28","doi-asserted-by":"publisher","DOI":"10.1109\/TIT.1987.1057341"},{"key":"ref4","doi-asserted-by":"publisher","DOI":"10.1109\/TIT.1979.1056084"},{"key":"ref27","author":"abbas","year":"2011","journal-title":"Network Information Theory"},{"key":"ref3","doi-asserted-by":"publisher","DOI":"10.2307\/1426331"},{"key":"ref6","doi-asserted-by":"publisher","DOI":"10.1109\/TIT.2006.881746"},{"key":"ref29","doi-asserted-by":"publisher","DOI":"10.1109\/ISIT.2008.4595031"},{"key":"ref5","doi-asserted-by":"publisher","DOI":"10.1109\/18.850663"},{"key":"ref8","doi-asserted-by":"crossref","DOI":"10.1561\/9781933019833","author":"xue","year":"2006","journal-title":"Scaling Laws for ad hoc Wireless Networks An Information Theoretic Approach"},{"key":"ref7","first-page":"d4.1.1","article-title":"On information flow in relay networks","volume":"2","author":"gamal","year":"1981","journal-title":"IEEE Nat Telecommun Conf"},{"key":"ref2","doi-asserted-by":"crossref","first-page":"1872","DOI":"10.1109\/TIT.2011.2110110","article-title":"Wireless network information flow: A deterministic approach","volume":"57","author":"avestimehr","year":"2011","journal-title":"IEEE Trans Inf Theory"},{"key":"ref9","doi-asserted-by":"publisher","DOI":"10.1109\/TIT.2004.826631"},{"key":"ref1","doi-asserted-by":"publisher","DOI":"10.1109\/TIT.2011.2120070"},{"key":"ref20","doi-asserted-by":"publisher","DOI":"10.1109\/TIT.2002.807285"},{"key":"ref22","author":"liew","year":"2011","journal-title":"Physical-layer Network Coding Tutorial Survey and Beyond"},{"key":"ref21","doi-asserted-by":"publisher","DOI":"10.1109\/ITW.2011.6089511"},{"key":"ref24","doi-asserted-by":"publisher","DOI":"10.1109\/ISIT.2012.6283635"},{"key":"ref23","doi-asserted-by":"publisher","DOI":"10.1109\/ISIT.2010.5513739"},{"key":"ref26","doi-asserted-by":"publisher","DOI":"10.1002\/0471200611"},{"key":"ref25","first-page":"481","article-title":"An algebraic definition of simulation between programs","author":"milner","year":"1971","journal-title":"Proc Int Joint Conf Artif Intell"}],"container-title":["IEEE Transactions on Information Theory"],"original-title":[],"link":[{"URL":"http:\/\/xplorestaging.ieee.org\/ielx5\/18\/6504538\/06392279.pdf?arnumber=6392279","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2021,11,29]],"date-time":"2021-11-29T20:47:41Z","timestamp":1638218861000},"score":1,"resource":{"primary":{"URL":"http:\/\/ieeexplore.ieee.org\/document\/6392279\/"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2013,5]]},"references-count":30,"journal-issue":{"issue":"5"},"URL":"https:\/\/doi.org\/10.1109\/tit.2012.2235906","relation":{},"ISSN":["0018-9448","1557-9654"],"issn-type":[{"value":"0018-9448","type":"print"},{"value":"1557-9654","type":"electronic"}],"subject":[],"published":{"date-parts":[[2013,5]]}}}