{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2024,9,4]],"date-time":"2024-09-04T01:54:37Z","timestamp":1725414877057},"reference-count":17,"publisher":"IEEE","content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2005]]},"DOI":"10.1109\/itw.2005.1531850","type":"proceedings-article","created":{"date-parts":[[2005,11,15]],"date-time":"2005-11-15T10:48:27Z","timestamp":1132051707000},"page":"5 pp.","source":"Crossref","is-referenced-by-count":4,"title":["Interference management via capacity-achieving codes for the deterministic broadcast channel"],"prefix":"10.1109","author":[{"given":"T.P.","family":"Coleman","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"E.","family":"Martinian","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"M.","family":"Effros","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"M.","family":"Medard","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"263","reference":[{"key":"17","doi-asserted-by":"publisher","DOI":"10.1109\/18.910573"},{"key":"15","doi-asserted-by":"publisher","DOI":"10.1109\/18.720546"},{"key":"16","article-title":"Iterative quantization using codes on graphs","author":"martinian","year":"2003","journal-title":"Allerton Conference on Communication Control and Computing"},{"key":"13","doi-asserted-by":"publisher","DOI":"10.1109\/TIT.1973.1055037"},{"journal-title":"Information Theory and Reliable Communication","year":"1968","author":"gallager","key":"14"},{"key":"11","doi-asserted-by":"publisher","DOI":"10.1109\/TIT.1973.1054929"},{"key":"12","doi-asserted-by":"publisher","DOI":"10.1109\/SFCS.2002.1181950"},{"key":"3","article-title":"Approaching the dirty paper limit in canceling known interference","author":"erez","year":"2004","journal-title":"Allerton Conference on Communication Control and Computing"},{"key":"2","doi-asserted-by":"publisher","DOI":"10.1109\/TIT.1983.1056659"},{"key":"1","doi-asserted-by":"publisher","DOI":"10.1109\/ISIT.2004.1365211"},{"key":"10","doi-asserted-by":"publisher","DOI":"10.1109\/ISIT.2005.1523735"},{"key":"7","article-title":"The capacity region of deterministic broadcast channels","author":"marton","year":"1977","journal-title":"IEEE International Symposium on Information Theory"},{"key":"6","doi-asserted-by":"publisher","DOI":"10.1109\/TIT.1962.1057683"},{"key":"5","doi-asserted-by":"publisher","DOI":"10.1109\/ICC.1993.397441"},{"key":"4","doi-asserted-by":"publisher","DOI":"10.1109\/TIT.2009.2021319"},{"key":"9","doi-asserted-by":"publisher","DOI":"10.1109\/TIT.1979.1056046"},{"key":"8","first-page":"97","article-title":"Capacity of noiseless broadcast channels","author":"pinsker","year":"1978","journal-title":"Probl Inform Transm"}],"event":{"name":"IEEE Information Theory Workshop, 2005.","start":{"date-parts":[[2005,8,29]]},"location":"Rotorua, New Zealand","end":{"date-parts":[[2005,8,29]]}},"container-title":["IEEE Information Theory Workshop, 2005."],"original-title":[],"link":[{"URL":"http:\/\/xplorestaging.ieee.org\/ielx5\/10256\/32676\/01531850.pdf?arnumber=1531850","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2017,3,14]],"date-time":"2017-03-14T14:56:46Z","timestamp":1489503406000},"score":1,"resource":{"primary":{"URL":"http:\/\/ieeexplore.ieee.org\/document\/1531850\/"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2005]]},"references-count":17,"URL":"https:\/\/doi.org\/10.1109\/itw.2005.1531850","relation":{},"subject":[],"published":{"date-parts":[[2005]]}}}