iBet uBet web content aggregator. Adding the entire web to your favor.
iBet uBet web content aggregator. Adding the entire web to your favor.



Link to original content: https://api.crossref.org/works/10.1109/ISIT45174.2021.9517756
{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2024,10,30]],"date-time":"2024-10-30T07:48:10Z","timestamp":1730274490700,"version":"3.28.0"},"reference-count":21,"publisher":"IEEE","license":[{"start":{"date-parts":[[2021,7,12]],"date-time":"2021-07-12T00:00:00Z","timestamp":1626048000000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/ieeexplore.ieee.org\/Xplorehelp\/downloads\/license-information\/IEEE.html"},{"start":{"date-parts":[[2021,7,12]],"date-time":"2021-07-12T00:00:00Z","timestamp":1626048000000},"content-version":"stm-asf","delay-in-days":0,"URL":"https:\/\/doi.org\/10.15223\/policy-029"},{"start":{"date-parts":[[2021,7,12]],"date-time":"2021-07-12T00:00:00Z","timestamp":1626048000000},"content-version":"stm-asf","delay-in-days":0,"URL":"https:\/\/doi.org\/10.15223\/policy-037"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2021,7,12]]},"DOI":"10.1109\/isit45174.2021.9517756","type":"proceedings-article","created":{"date-parts":[[2021,9,1]],"date-time":"2021-09-01T20:52:42Z","timestamp":1630529562000},"page":"1648-1652","source":"Crossref","is-referenced-by-count":1,"title":["Soft Minoration: Solution to Cover's Problem In the Original Discrete Memoryless Setting"],"prefix":"10.1109","author":[{"given":"Jingbo","family":"Liu","sequence":"first","affiliation":[]}],"member":"263","reference":[{"key":"ref10","doi-asserted-by":"publisher","DOI":"10.1109\/TIT.2020.3041791"},{"journal-title":"Minoration via mixed volumes and Cover's problem for general channels","year":"0","author":"liu","key":"ref11"},{"journal-title":"Information theory from a functional viewpoint","year":"2018","author":"liu","key":"ref12"},{"key":"ref13","first-page":"2629","article-title":"E?-resolvability","volume":"63","author":"liu","year":"2016","journal-title":"IEEE Transactions on Information Theory"},{"key":"ref14","doi-asserted-by":"publisher","DOI":"10.1109\/TIT.2020.3008599"},{"key":"ref15","doi-asserted-by":"publisher","DOI":"10.4171\/MSL\/13"},{"key":"ref16","doi-asserted-by":"publisher","DOI":"10.1109\/ISIT.2017.8006667"},{"key":"ref17","doi-asserted-by":"publisher","DOI":"10.1109\/TIT.2016.2562630"},{"key":"ref18","doi-asserted-by":"publisher","DOI":"10.1109\/TIT.2018.2876892"},{"key":"ref19","doi-asserted-by":"publisher","DOI":"10.1109\/TIT.2017.2731963"},{"key":"ref4","doi-asserted-by":"publisher","DOI":"10.1109\/ISIT.2015.7282856"},{"key":"ref3","doi-asserted-by":"publisher","DOI":"10.1109\/ALLERTON.2017.8262827"},{"journal-title":"Strengthened cutset upper bounds on the capacity of the relay channel and applications","year":"2021","author":"el gamal","key":"ref6"},{"key":"ref5","doi-asserted-by":"publisher","DOI":"10.1007\/978-1-4612-4808-8_17"},{"key":"ref8","doi-asserted-by":"publisher","DOI":"10.1109\/18.605594"},{"key":"ref7","doi-asserted-by":"publisher","DOI":"10.1109\/18.256486"},{"key":"ref2","doi-asserted-by":"publisher","DOI":"10.1109\/ISIT44484.2020.9174478"},{"key":"ref1","first-page":"157","article-title":"Bounds on conditional probabilities with applications in multi-user communication","volume":"34","author":"ahlswede","year":"1976","journal-title":"Probability Theory and Related Fields"},{"journal-title":"Forty-Fifth Annual Allerton Conference Allerton House UIUC","article-title":"Coding techniques for primitive relay channels","year":"2007","author":"kim","key":"ref9"},{"key":"ref20","doi-asserted-by":"publisher","DOI":"10.1109\/TIT.2017.2664811"},{"key":"ref21","doi-asserted-by":"publisher","DOI":"10.1109\/18.21243"}],"event":{"name":"2021 IEEE International Symposium on Information Theory (ISIT)","start":{"date-parts":[[2021,7,12]]},"location":"Melbourne, Australia","end":{"date-parts":[[2021,7,20]]}},"container-title":["2021 IEEE International Symposium on Information Theory (ISIT)"],"original-title":[],"link":[{"URL":"http:\/\/xplorestaging.ieee.org\/ielx7\/9517708\/9517709\/09517756.pdf?arnumber=9517756","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2022,5,10]],"date-time":"2022-05-10T15:44:52Z","timestamp":1652197492000},"score":1,"resource":{"primary":{"URL":"https:\/\/ieeexplore.ieee.org\/document\/9517756\/"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2021,7,12]]},"references-count":21,"URL":"https:\/\/doi.org\/10.1109\/isit45174.2021.9517756","relation":{},"subject":[],"published":{"date-parts":[[2021,7,12]]}}}