{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,4,9]],"date-time":"2025-04-09T16:52:56Z","timestamp":1744217576205,"version":"3.37.3"},"reference-count":36,"publisher":"Institute of Electrical and Electronics Engineers (IEEE)","issue":"10","license":[{"start":{"date-parts":[[2018,10,1]],"date-time":"2018-10-01T00:00:00Z","timestamp":1538352000000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/ieeexplore.ieee.org\/Xplorehelp\/downloads\/license-information\/IEEE.html"},{"start":{"date-parts":[[2018,10,1]],"date-time":"2018-10-01T00:00:00Z","timestamp":1538352000000},"content-version":"am","delay-in-days":0,"URL":"https:\/\/ieeexplore.ieee.org\/Xplorehelp\/downloads\/license-information\/IEEE.html"},{"start":{"date-parts":[[2018,10,1]],"date-time":"2018-10-01T00:00:00Z","timestamp":1538352000000},"content-version":"stm-asf","delay-in-days":0,"URL":"https:\/\/doi.org\/10.15223\/policy-029"},{"start":{"date-parts":[[2018,10,1]],"date-time":"2018-10-01T00:00:00Z","timestamp":1538352000000},"content-version":"stm-asf","delay-in-days":0,"URL":"https:\/\/doi.org\/10.15223\/policy-037"}],"funder":[{"DOI":"10.13039\/100000001","name":"National Science Foundation","doi-asserted-by":"publisher","award":["CCF-1149888"],"award-info":[{"award-number":["CCF-1149888"]}],"id":[{"id":"10.13039\/100000001","id-type":"DOI","asserted-by":"publisher"}]},{"DOI":"10.13039\/501100003977","name":"Israel Science Foundation","doi-asserted-by":"publisher","award":["1078\/17"],"award-info":[{"award-number":["1078\/17"]}],"id":[{"id":"10.13039\/501100003977","id-type":"DOI","asserted-by":"publisher"}]},{"DOI":"10.13039\/100000001","name":"National Science Foundation","doi-asserted-by":"publisher","award":["CCF-1527110","CCF-1618280"],"award-info":[{"award-number":["CCF-1527110","CCF-1618280"]}],"id":[{"id":"10.13039\/100000001","id-type":"DOI","asserted-by":"publisher"}]},{"name":"NSF CAREER","award":["CCF-1750808"],"award-info":[{"award-number":["CCF-1750808"]}]},{"name":"Fund for Math"},{"DOI":"10.13039\/501100001735","name":"Weizmann Institute of Science","doi-asserted-by":"publisher","id":[{"id":"10.13039\/501100001735","id-type":"DOI","asserted-by":"publisher"}]},{"DOI":"10.13039\/100000001","name":"National Science Foundation","doi-asserted-by":"publisher","award":["CCF-1412958","CCF-1445755"],"award-info":[{"award-number":["CCF-1412958","CCF-1445755"]}],"id":[{"id":"10.13039\/100000001","id-type":"DOI","asserted-by":"publisher"}]},{"name":"Rothschild fellowship"},{"name":"Alon fellowship"},{"DOI":"10.13039\/100000001","name":"National Science Foundation","doi-asserted-by":"publisher","award":["CCF-1412958"],"award-info":[{"award-number":["CCF-1412958"]}],"id":[{"id":"10.13039\/100000001","id-type":"DOI","asserted-by":"publisher"}]}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":["IEEE Trans. Inform. Theory"],"published-print":{"date-parts":[[2018,10]]},"DOI":"10.1109\/tit.2018.2829764","type":"journal-article","created":{"date-parts":[[2018,4,24]],"date-time":"2018-04-24T19:19:05Z","timestamp":1524597545000},"page":"6546-6560","source":"Crossref","is-referenced-by-count":10,"title":["Explicit Capacity Approaching Coding for Interactive Communication"],"prefix":"10.1109","volume":"64","author":[{"ORCID":"https:\/\/orcid.org\/0000-0003-3615-3239","authenticated-orcid":false,"given":"Ran","family":"Gelles","sequence":"first","affiliation":[]},{"given":"Bernhard","family":"Haeupler","sequence":"additional","affiliation":[]},{"given":"Gillat","family":"Kol","sequence":"additional","affiliation":[]},{"ORCID":"https:\/\/orcid.org\/0000-0002-8416-893X","authenticated-orcid":false,"given":"Noga","family":"Ron-Zewi","sequence":"additional","affiliation":[]},{"given":"Avi","family":"Wigderson","sequence":"additional","affiliation":[]}],"member":"263","reference":[{"journal-title":"A Postcript to ‘Coding for Interactive Communication’","year":"2003","author":"schulman","key":"ref33"},{"key":"ref32","doi-asserted-by":"publisher","DOI":"10.1109\/18.556671"},{"key":"ref31","doi-asserted-by":"publisher","DOI":"10.1145\/167088.167279"},{"key":"ref30","doi-asserted-by":"publisher","DOI":"10.1109\/SFCS.1992.267778"},{"key":"ref36","first-page":"209","article-title":"Some complexity questions related to distributive computing(preliminary report)","author":"yao","year":"1979","journal-title":"Proc 11th Annu ACM Symp Theory Comput"},{"key":"ref35","first-page":"739","article-title":"Estimate of the number of signals in error correcting codes","volume":"117","author":"varshamov","year":"1957","journal-title":"Doklady Akademii Nauk SSSR"},{"key":"ref34","doi-asserted-by":"publisher","DOI":"10.1002\/j.1538-7305.1948.tb01338.x"},{"key":"ref10","first-page":"50:1","article-title":"Making asynchronous distributed computations robust to channel noise","volume":"94","author":"censor-hillel","year":"2018","journal-title":"Proc Conf Innov Theoretical Comput Sci (ITCS)"},{"key":"ref11","first-page":"1","article-title":"Explicit binary tree codes with polylogarithmic size alphabet","author":"cohen","year":"2018","journal-title":"Proc 50th Annu ACM Symp Theory Comput"},{"key":"ref12","doi-asserted-by":"publisher","DOI":"10.1016\/S0020-0190(00)00002-8"},{"article-title":"Concatenated codes","year":"1965","author":"forney","key":"ref13"},{"key":"ref14","doi-asserted-by":"publisher","DOI":"10.1109\/TIT.2014.2367094"},{"key":"ref15","doi-asserted-by":"publisher","DOI":"10.1561\/0400000079"},{"key":"ref16","doi-asserted-by":"publisher","DOI":"10.1109\/TIT.2013.2294186"},{"key":"ref17","first-page":"1","article-title":"Constant-rate interactive coding is impossible, even in constant-degree networks","volume":"67","author":"gelles","year":"2017","journal-title":"Leibniz International Proceedings in Informatics"},{"key":"ref18","doi-asserted-by":"publisher","DOI":"10.1109\/FOCS.2014.49"},{"key":"ref19","doi-asserted-by":"publisher","DOI":"10.1145\/2591796.2591872"},{"key":"ref28","doi-asserted-by":"publisher","DOI":"10.1137\/0222053"},{"key":"ref4","doi-asserted-by":"publisher","DOI":"10.1145\/2661628"},{"key":"ref27","doi-asserted-by":"publisher","DOI":"10.1145\/2488608.2488699"},{"key":"ref3","doi-asserted-by":"publisher","DOI":"10.1002\/rsa.3240030308"},{"key":"ref6","doi-asserted-by":"publisher","DOI":"10.1137\/141002001"},{"key":"ref29","doi-asserted-by":"publisher","DOI":"10.1137\/0108018"},{"key":"ref5","doi-asserted-by":"publisher","DOI":"10.1145\/2090236.2090250"},{"key":"ref8","doi-asserted-by":"publisher","DOI":"10.1109\/TIT.2017.2734881"},{"key":"ref7","article-title":"Constant-rate coding for multiparty interactive communication is impossible","volume":"65","author":"braverman","year":"2017","journal-title":"J ACM"},{"key":"ref2","doi-asserted-by":"publisher","DOI":"10.1145\/2933057.2933085"},{"key":"ref9","doi-asserted-by":"publisher","DOI":"10.1109\/TIT.2014.2353994"},{"key":"ref1","doi-asserted-by":"publisher","DOI":"10.1109\/ISIT.2016.7541368"},{"key":"ref20","doi-asserted-by":"publisher","DOI":"10.1002\/j.1538-7305.1952.tb01393.x"},{"key":"ref22","doi-asserted-by":"publisher","DOI":"10.1109\/FOCS.2014.32"},{"key":"ref21","doi-asserted-by":"publisher","DOI":"10.1109\/FOCS.2014.32"},{"journal-title":"Synchronization strings Channel simulations and interactive coding for insertions and deletions","year":"2017","author":"haeupler","key":"ref24"},{"key":"ref23","doi-asserted-by":"publisher","DOI":"10.1145\/3055399.3055498"},{"key":"ref26","doi-asserted-by":"publisher","DOI":"10.1002\/j.1538-7305.1950.tb00463.x"},{"key":"ref25","first-page":"2123","article-title":"Bridging the capacity gap between interactive and one-way communication","author":"haeupler","year":"2017","journal-title":"Proceedings of the 5th Annual ACM-SIAM Symposium on Discrete Algorithms"}],"container-title":["IEEE Transactions on Information Theory"],"original-title":[],"link":[{"URL":"https:\/\/ieeexplore.ieee.org\/ielaam\/18\/8464702\/8345651-aam.pdf","content-type":"application\/pdf","content-version":"am","intended-application":"syndication"},{"URL":"http:\/\/xplorestaging.ieee.org\/ielx7\/18\/8464702\/08345651.pdf?arnumber=8345651","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2022,4,8]],"date-time":"2022-04-08T18:54:49Z","timestamp":1649444089000},"score":1,"resource":{"primary":{"URL":"https:\/\/ieeexplore.ieee.org\/document\/8345651\/"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2018,10]]},"references-count":36,"journal-issue":{"issue":"10"},"URL":"https:\/\/doi.org\/10.1109\/tit.2018.2829764","relation":{},"ISSN":["0018-9448","1557-9654"],"issn-type":[{"type":"print","value":"0018-9448"},{"type":"electronic","value":"1557-9654"}],"subject":[],"published":{"date-parts":[[2018,10]]}}}