{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,8,26]],"date-time":"2026-08-26T16:16:07Z","timestamp":1787760967151,"version":"build-2784847793"},"reference-count":35,"publisher":"Institute of Electrical and Electronics Engineers (IEEE)","issue":"12","license":[{"start":{"date-parts":[[2016,12,1]],"date-time":"2016-12-01T00:00:00Z","timestamp":1480550400000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/ieeexplore.ieee.org\/Xplorehelp\/downloads\/license-information\/IEEE.html"}],"funder":[{"name":"German Federal Ministry of Education and Research in the framework of the Alexander von Humboldt-Professorship"},{"name":"Swiss National Science Foundation Fellowship","award":["146617"],"award-info":[{"award-number":["146617"]}]}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":["IEEE Trans. Inform. Theory"],"published-print":{"date-parts":[[2016,12]]},"DOI":"10.1109\/tit.2016.2609388","type":"journal-article","created":{"date-parts":[[2016,9,14]],"date-time":"2016-09-14T18:24:10Z","timestamp":1473877450000},"page":"7103-7122","source":"Crossref","is-referenced-by-count":17,"title":["Capacity Bounds for Diamond Networks With an Orthogonal Broadcast Channel"],"prefix":"10.1109","volume":"62","author":[{"ORCID":"https:\/\/orcid.org\/0000-0002-3790-202X","authenticated-orcid":false,"given":"Shirin","family":"Saeedi Bidokhti","sequence":"first","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]},{"given":"Gerhard","family":"Kramer","sequence":"additional","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]}],"member":"263","reference":[{"key":"ref33","doi-asserted-by":"publisher","DOI":"10.1109\/TIT.2007.894680"},{"key":"ref32","article-title":"Generalization of Mrs. Gerber’s lemma","volume":"abs 1409 1668","author":"cheng","year":"2014","journal-title":"CoRR"},{"key":"ref31","doi-asserted-by":"publisher","DOI":"10.1109\/TIT.2014.2317692"},{"key":"ref30","doi-asserted-by":"publisher","DOI":"10.1109\/ISIT.2013.6620294"},{"key":"ref35","doi-asserted-by":"publisher","DOI":"10.1017\/CBO9780511810817"},{"key":"ref34","doi-asserted-by":"publisher","DOI":"10.1002\/j.1538-7305.1948.tb01338.x"},{"key":"ref10","doi-asserted-by":"publisher","DOI":"10.1109\/ITW.2012.6404698"},{"key":"ref11","doi-asserted-by":"publisher","DOI":"10.1109\/TIT.2014.2360843"},{"key":"ref12","doi-asserted-by":"publisher","DOI":"10.1002\/j.1538-7305.1980.tb03344.x"},{"key":"ref13","doi-asserted-by":"publisher","DOI":"10.1109\/TIT.2015.2479923"},{"key":"ref14","doi-asserted-by":"publisher","DOI":"10.1017\/CBO9781139030687"},{"key":"ref15","doi-asserted-by":"publisher","DOI":"10.1109\/TIT.1985.1057042"},{"key":"ref16","author":"cover","year":"2006","journal-title":"Elements of Information Theory"},{"key":"ref17","doi-asserted-by":"publisher","DOI":"10.1109\/TIT.2014.2360698"},{"key":"ref18","doi-asserted-by":"publisher","DOI":"10.1109\/TIT.2008.920249"},{"key":"ref19","doi-asserted-by":"publisher","DOI":"10.1109\/18.42175"},{"key":"ref28","doi-asserted-by":"publisher","DOI":"10.1109\/ISIT.2011.6033891"},{"key":"ref4","doi-asserted-by":"publisher","DOI":"10.1109\/ITW.2007.4313098"},{"key":"ref27","first-page":"93","article-title":"An entropy power inequality for the binomial family","volume":"4","author":"peter","year":"2003","journal-title":"J Inequal Pure Appl Math"},{"key":"ref3","article-title":"Distributed coordination in network information theory","author":"schein","year":"2001"},{"key":"ref6","doi-asserted-by":"publisher","DOI":"10.1109\/TIT.2011.2158877"},{"key":"ref29","doi-asserted-by":"publisher","DOI":"10.1109\/TIT.2010.2070570"},{"key":"ref5","doi-asserted-by":"publisher","DOI":"10.1109\/ISIT.2011.6033791"},{"key":"ref8","doi-asserted-by":"publisher","DOI":"10.1109\/TIT.2011.2110110"},{"key":"ref7","doi-asserted-by":"publisher","DOI":"10.1109\/TIT.2008.924659"},{"key":"ref2","doi-asserted-by":"publisher","DOI":"10.1109\/ISIT.2016.7541582"},{"key":"ref9","doi-asserted-by":"publisher","DOI":"10.1109\/TIT.2012.2219154"},{"key":"ref1","first-page":"1196","article-title":"Capacity bounds for a class of diamond networks","author":"bidokhti","year":"2014","journal-title":"Proc Int Symp Inf Theory"},{"key":"ref20","doi-asserted-by":"publisher","DOI":"10.1109\/TIT.1987.1057341"},{"key":"ref22","doi-asserted-by":"publisher","DOI":"10.1109\/TIT.1973.1055107"},{"key":"ref21","doi-asserted-by":"publisher","DOI":"10.1109\/TIT.2011.2145150"},{"key":"ref24","first-page":"13","article-title":"On the connection between the entropies of input and output distributions of discrete memoryless channels","author":"ahlswede","year":"1974","journal-title":"Proc 5th Conf Probability Theory"},{"key":"ref23","doi-asserted-by":"publisher","DOI":"10.1109\/TIT.1974.1055285"},{"key":"ref26","doi-asserted-by":"publisher","DOI":"10.1109\/18.59938"},{"key":"ref25","doi-asserted-by":"publisher","DOI":"10.1109\/18.42224"}],"container-title":["IEEE Transactions on Information Theory"],"original-title":[],"link":[{"URL":"http:\/\/xplorestaging.ieee.org\/ielx7\/18\/7748579\/07567589.pdf?arnumber=7567589","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2022,1,12]],"date-time":"2022-01-12T16:20:47Z","timestamp":1642004447000},"score":1,"resource":{"primary":{"URL":"http:\/\/ieeexplore.ieee.org\/document\/7567589\/"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2016,12]]},"references-count":35,"journal-issue":{"issue":"12"},"URL":"https:\/\/doi.org\/10.1109\/tit.2016.2609388","relation":{},"ISSN":["0018-9448","1557-9654"],"issn-type":[{"value":"0018-9448","type":"print"},{"value":"1557-9654","type":"electronic"}],"subject":[],"published":{"date-parts":[[2016,12]]}}}