{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2024,10,30]],"date-time":"2024-10-30T07:48:07Z","timestamp":1730274487137,"version":"3.28.0"},"reference-count":19,"publisher":"IEEE","content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2011,7]]},"DOI":"10.1109\/isit.2011.6033805","type":"proceedings-article","created":{"date-parts":[[2011,10,6]],"date-time":"2011-10-06T13:24:20Z","timestamp":1317907460000},"page":"1554-1558","source":"Crossref","is-referenced-by-count":11,"title":["Nested linear codes achieve Marton's inner bound for general broadcast channels"],"prefix":"10.1109","author":[{"given":"Arun","family":"Padakandla","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"S. Sandeep","family":"Pradhan","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"263","reference":[{"key":"ref10","article-title":"Distributed source coding using abelian group codes","author":"krithivasan","year":"2008","journal-title":"submitted to IEEE Trans on Inform Th"},{"article-title":"Multiterminal source coding","year":"1978","author":"tung","key":"ref11"},{"key":"ref12","article-title":"Compute-and-forward: Harnessing interference through structured codes","author":"nazer","year":"2009","journal-title":"submitted to IEEE Trans on Inform Th"},{"key":"ref13","doi-asserted-by":"publisher","DOI":"10.1109\/ISIT.2009.5205270"},{"key":"ref14","first-page":"37","article-title":"Coding for noisy channels","author":"elias","year":"1955","journal-title":"IRE Conv Rec"},{"key":"ref15","doi-asserted-by":"publisher","DOI":"10.1109\/TIT.1974.1055171"},{"key":"ref16","doi-asserted-by":"publisher","DOI":"10.1109\/TIT.1973.1055037"},{"key":"ref17","doi-asserted-by":"publisher","DOI":"10.1214\/aoms\/1177693508"},{"journal-title":"Information Theory and Reliable Communication","year":"1968","author":"gallager","key":"ref18"},{"key":"ref19","doi-asserted-by":"publisher","DOI":"10.1109\/TIT.1981.1056302"},{"journal-title":"Information Theory Coding Theorems for Discrete Memoryless Systems","year":"1986","author":"csisz\u00e1r","key":"ref4"},{"key":"ref3","doi-asserted-by":"publisher","DOI":"10.1109\/TIT.1979.1056046"},{"key":"ref6","doi-asserted-by":"publisher","DOI":"10.1109\/ISIT.2009.5206066"},{"key":"ref5","first-page":"24","article-title":"Capacity of a broadcast channel with one deterministic component","volume":"16","author":"gel'fand","year":"1980","journal-title":"Probl Peredachi Inf"},{"key":"ref8","doi-asserted-by":"publisher","DOI":"10.1109\/TIT.1979.1056022"},{"key":"ref7","doi-asserted-by":"publisher","DOI":"10.1109\/TIT.2006.887492"},{"key":"ref2","first-page":"19","article-title":"Coding for channel with random parameters","volume":"19","author":"gel'fand","year":"1980","journal-title":"Problems of Control and Information Theory"},{"key":"ref1","doi-asserted-by":"publisher","DOI":"10.1109\/TIT.1972.1054727"},{"key":"ref9","doi-asserted-by":"publisher","DOI":"10.1109\/TIT.2009.2018174"}],"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\/06033805.pdf?arnumber=6033805","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2017,3,20]],"date-time":"2017-03-20T22:57:33Z","timestamp":1490050653000},"score":1,"resource":{"primary":{"URL":"http:\/\/ieeexplore.ieee.org\/document\/6033805\/"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2011,7]]},"references-count":19,"URL":"https:\/\/doi.org\/10.1109\/isit.2011.6033805","relation":{},"subject":[],"published":{"date-parts":[[2011,7]]}}}