{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,8,15]],"date-time":"2025-08-15T00:50:50Z","timestamp":1755219050791,"version":"3.43.0"},"reference-count":14,"publisher":"IEEE","license":[{"start":{"date-parts":[[2018,6,1]],"date-time":"2018-06-01T00:00:00Z","timestamp":1527811200000},"content-version":"stm-asf","delay-in-days":0,"URL":"https:\/\/doi.org\/10.15223\/policy-029"},{"start":{"date-parts":[[2018,6,1]],"date-time":"2018-06-01T00:00:00Z","timestamp":1527811200000},"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":[[2018,6]]},"DOI":"10.1109\/isit.2018.8437795","type":"proceedings-article","created":{"date-parts":[[2018,8,17]],"date-time":"2018-08-17T16:14:55Z","timestamp":1534522495000},"page":"1126-1130","source":"Crossref","is-referenced-by-count":0,"title":["Bounds on the Effective-length of Optimal Codes for Interference Channel with Feedback"],"prefix":"10.1109","author":[{"given":"Mohsen","family":"Heidari","sequence":"first","affiliation":[{"name":"University of Michigan, EECS Department, Ann Arbor, USA"}]},{"given":"Farhad","family":"Shirani","sequence":"additional","affiliation":[{"name":"New York university, Department of Electrical and Computer Engineering, New York, New York"}]},{"given":"S. Sandeep","family":"Pradhan","sequence":"additional","affiliation":[{"name":"University of Michigan, EECS Department, Ann Arbor, USA"}]}],"member":"263","reference":[{"key":"ref10","doi-asserted-by":"publisher","DOI":"10.1109\/ISIT.2014.6875124"},{"key":"ref11","doi-asserted-by":"publisher","DOI":"10.1109\/TIT.2011.2119810"},{"key":"ref12","doi-asserted-by":"publisher","DOI":"10.1109\/TIT.2002.1003831"},{"key":"ref13","doi-asserted-by":"publisher","DOI":"10.1109\/TIT.2011.2145570"},{"journal-title":"Bounds on the Effective-length of Optimal Codes for Interference Channel with Feedback","year":"2018","author":"heidari","key":"ref14"},{"key":"ref4","doi-asserted-by":"publisher","DOI":"10.1109\/TIT.1987.1057330"},{"key":"ref3","doi-asserted-by":"publisher","DOI":"10.1109\/TIT.1979.1056046"},{"key":"ref6","doi-asserted-by":"publisher","DOI":"10.1137\/0128010"},{"journal-title":"Information Theory Coding Theorems for Discrete Memoryless Systems","year":"1981","author":"csiszar","key":"ref5"},{"journal-title":"On the sub-optimality of single-letter coding in multi-terminal communications","year":"2017","author":"shirani","key":"ref8"},{"key":"ref7","first-page":"119","article-title":"Common information is far less than mutual information","volume":"2","author":"gacs","year":"1972","journal-title":"PROBLEMS CONTROL INFORM THEORY"},{"journal-title":"Multiterrninal Source Coding","year":"1978","author":"tung","key":"ref2"},{"key":"ref1","doi-asserted-by":"publisher","DOI":"10.1109\/TIT.1981.1056307"},{"key":"ref9","first-page":"1301","article-title":"On the correlation between boolean functions of sequences of random variables","author":"shirani","year":"2017","journal-title":"IEEE Int Symp Inform Theory (ISIT)"}],"event":{"name":"2018 IEEE International Symposium on Information Theory (ISIT)","start":{"date-parts":[[2018,6,17]]},"location":"Vail, CO, USA","end":{"date-parts":[[2018,6,22]]}},"container-title":["2018 IEEE International Symposium on Information Theory (ISIT)"],"original-title":[],"link":[{"URL":"http:\/\/xplorestaging.ieee.org\/ielx7\/8410646\/8437120\/08437795.pdf?arnumber=8437795","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2025,8,6]],"date-time":"2025-08-06T17:56:31Z","timestamp":1754502991000},"score":1,"resource":{"primary":{"URL":"https:\/\/ieeexplore.ieee.org\/document\/8437795\/"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2018,6]]},"references-count":14,"URL":"https:\/\/doi.org\/10.1109\/isit.2018.8437795","relation":{},"subject":[],"published":{"date-parts":[[2018,6]]}}}