{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2024,10,30]],"date-time":"2024-10-30T07:43:13Z","timestamp":1730274193667,"version":"3.28.0"},"reference-count":21,"publisher":"IEEE","content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2017,6]]},"DOI":"10.1109\/isit.2017.8006665","type":"proceedings-article","created":{"date-parts":[[2017,8,29]],"date-time":"2017-08-29T14:54:37Z","timestamp":1504018477000},"page":"933-937","source":"Crossref","is-referenced-by-count":1,"title":["Strong converse theorems for discrete memoryless networks with tight cut-set bound"],"prefix":"10.1109","author":[{"given":"Silas L.","family":"Fong","sequence":"first","affiliation":[]},{"given":"Vincent Y. F.","family":"Tan","sequence":"additional","affiliation":[]}],"member":"263","reference":[{"key":"ref10","doi-asserted-by":"publisher","DOI":"10.1109\/TIT.2016.2584082"},{"key":"ref11","doi-asserted-by":"publisher","DOI":"10.1109\/ALLERTON.2010.5707067"},{"key":"ref12","doi-asserted-by":"publisher","DOI":"10.1109\/TIT.2010.2102110"},{"key":"ref13","doi-asserted-by":"publisher","DOI":"10.1109\/TIT.2005.864424"},{"key":"ref14","doi-asserted-by":"publisher","DOI":"10.1109\/TIT.1982.1056444"},{"key":"ref15","article-title":"Strong converse theorems for multimessage networks with tight cut-set bound","author":"fong","year":"2016","journal-title":"IEEE Trans Inf Theory"},{"key":"ref16","doi-asserted-by":"publisher","DOI":"10.1109\/ITW.2012.6404645"},{"journal-title":"Cooperative networks with channel uncertainty","year":"2012","author":"behboodi","key":"ref17"},{"key":"ref18","doi-asserted-by":"publisher","DOI":"10.1109\/ISIT.2015.7282593"},{"journal-title":"New strong converse for asymmetric broadcast channels","year":"2016","author":"oohama","key":"ref19"},{"key":"ref4","doi-asserted-by":"publisher","DOI":"10.1109\/TIT.2008.2011518"},{"key":"ref3","doi-asserted-by":"publisher","DOI":"10.1109\/TIT.1979.1056084"},{"journal-title":"Information flow in relay networks","year":"1980","author":"aref","key":"ref6"},{"key":"ref5","doi-asserted-by":"publisher","DOI":"10.1109\/TIT.2005.853304"},{"key":"ref8","doi-asserted-by":"publisher","DOI":"10.1109\/TIT.2005.846438"},{"key":"ref7","doi-asserted-by":"publisher","DOI":"10.1109\/TIT.1982.1056502"},{"key":"ref2","first-page":"d4.1.1","article-title":"On information flow in relay networks","volume":"2","author":"el gamal","year":"1981","journal-title":"Proc IEEE National Telecom Conference"},{"journal-title":"Network Information Theory","year":"2012","author":"el gamal","key":"ref1"},{"key":"ref9","doi-asserted-by":"publisher","DOI":"10.1109\/TIT.2011.2110110"},{"key":"ref20","doi-asserted-by":"publisher","DOI":"10.1017\/CBO9780511921889"},{"key":"ref21","doi-asserted-by":"publisher","DOI":"10.1109\/TIT.2015.2400999"}],"event":{"name":"2017 IEEE International Symposium on Information Theory (ISIT)","start":{"date-parts":[[2017,6,25]]},"location":"Aachen, Germany","end":{"date-parts":[[2017,6,30]]}},"container-title":["2017 IEEE International Symposium on Information Theory (ISIT)"],"original-title":[],"link":[{"URL":"http:\/\/xplorestaging.ieee.org\/ielx7\/7999336\/8006474\/08006665.pdf?arnumber=8006665","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2017,12,13]],"date-time":"2017-12-13T15:57:29Z","timestamp":1513180649000},"score":1,"resource":{"primary":{"URL":"http:\/\/ieeexplore.ieee.org\/document\/8006665\/"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2017,6]]},"references-count":21,"URL":"https:\/\/doi.org\/10.1109\/isit.2017.8006665","relation":{},"subject":[],"published":{"date-parts":[[2017,6]]}}}