{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,2,21]],"date-time":"2025-02-21T01:13:34Z","timestamp":1740100414192,"version":"3.37.3"},"reference-count":31,"publisher":"IEEE","license":[{"start":{"date-parts":[[2021,10,17]],"date-time":"2021-10-17T00:00:00Z","timestamp":1634428800000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/ieeexplore.ieee.org\/Xplorehelp\/downloads\/license-information\/IEEE.html"},{"start":{"date-parts":[[2021,10,17]],"date-time":"2021-10-17T00:00:00Z","timestamp":1634428800000},"content-version":"stm-asf","delay-in-days":0,"URL":"https:\/\/doi.org\/10.15223\/policy-029"},{"start":{"date-parts":[[2021,10,17]],"date-time":"2021-10-17T00:00:00Z","timestamp":1634428800000},"content-version":"stm-asf","delay-in-days":0,"URL":"https:\/\/doi.org\/10.15223\/policy-037"}],"funder":[{"DOI":"10.13039\/501100003977","name":"Israel Science Foundation","doi-asserted-by":"publisher","id":[{"id":"10.13039\/501100003977","id-type":"DOI","asserted-by":"publisher"}]}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2021,10,17]]},"DOI":"10.1109\/itw48936.2021.9611505","type":"proceedings-article","created":{"date-parts":[[2021,11,23]],"date-time":"2021-11-23T21:46:27Z","timestamp":1637703987000},"page":"1-6","source":"Crossref","is-referenced-by-count":0,"title":["Multiparty Interactive Communication with Broadcast Links"],"prefix":"10.1109","author":[{"given":"Manuj","family":"Mukherjee","sequence":"first","affiliation":[]},{"given":"Ran","family":"Gelles","sequence":"additional","affiliation":[]}],"member":"263","reference":[{"key":"ref31","article-title":"Introduction to Coding Theory","author":"van lint","year":"2004","journal-title":"Graduate Texts in Mathematics"},{"key":"ref30","doi-asserted-by":"publisher","DOI":"10.1145\/195058.195462"},{"key":"ref10","doi-asserted-by":"publisher","DOI":"10.1145\/2488608.2488699"},{"key":"ref11","doi-asserted-by":"publisher","DOI":"10.1109\/FOCS.2014.32"},{"article-title":"A lower bound on the interactive capacity of binary memoryless symmetric channels","year":"2019","author":"ben-yishai","key":"ref12"},{"key":"ref13","doi-asserted-by":"publisher","DOI":"10.1109\/TIT.2018.2829764"},{"key":"ref14","doi-asserted-by":"publisher","DOI":"10.1145\/2090236.2090250"},{"key":"ref15","doi-asserted-by":"publisher","DOI":"10.1109\/TIT.2013.2294186"},{"key":"ref16","doi-asserted-by":"publisher","DOI":"10.1145\/2661628"},{"key":"ref17","doi-asserted-by":"publisher","DOI":"10.1145\/195058.195462"},{"key":"ref18","doi-asserted-by":"publisher","DOI":"10.1145\/3050218"},{"key":"ref19","doi-asserted-by":"publisher","DOI":"10.1007\/s00446-017-0303-5"},{"key":"ref28","first-page":"82:1","article-title":"Computation over the noisy broadcast channel with malicious parties","volume":"185","author":"efremenko","year":"2021","journal-title":"12th Innovations in Theoretical Computer Science Conference ITCS 2021"},{"key":"ref4","doi-asserted-by":"publisher","DOI":"10.1109\/SFCS.1992.267778"},{"key":"ref27","doi-asserted-by":"publisher","DOI":"10.1145\/3188745.3188884"},{"key":"ref3","doi-asserted-by":"publisher","DOI":"10.1561\/0400000079"},{"key":"ref6","doi-asserted-by":"publisher","DOI":"10.1109\/TIT.2014.2353994"},{"key":"ref29","doi-asserted-by":"publisher","DOI":"10.1109\/JSAIT.2021.3126422"},{"key":"ref5","doi-asserted-by":"publisher","DOI":"10.1109\/18.556671"},{"key":"ref8","doi-asserted-by":"publisher","DOI":"10.1109\/FOCS.2014.49"},{"key":"ref7","doi-asserted-by":"publisher","DOI":"10.1137\/141002001"},{"key":"ref2","doi-asserted-by":"crossref","first-page":"209","DOI":"10.1145\/800135.804414","article-title":"Some complexity questions related to distributive computing(preliminary report)","author":"yao","year":"1979","journal-title":"Proc Eleventh Annual ACM Symposium on the Theory of Computing"},{"key":"ref9","first-page":"11:1","article-title":"Palette-Alternating Tree Codes","volume":"169","author":"cohen","year":"2020","journal-title":"35th Computational Complexity Conference (CCC 2020) ser Leibniz International Proceedings in Informatics (LIPIcs)"},{"key":"ref1","doi-asserted-by":"publisher","DOI":"10.1002\/j.1538-7305.1948.tb01338.x"},{"key":"ref20","doi-asserted-by":"publisher","DOI":"10.1109\/TIT.2019.2904576"},{"key":"ref22","doi-asserted-by":"publisher","DOI":"10.1137\/1.9781611974331.ch18"},{"key":"ref21","doi-asserted-by":"publisher","DOI":"10.1145\/2688073.2688109"},{"key":"ref24","doi-asserted-by":"publisher","DOI":"10.1145\/3293611.3331621"},{"key":"ref23","doi-asserted-by":"publisher","DOI":"10.1007\/s00446-018-0343-5"},{"key":"ref26","doi-asserted-by":"publisher","DOI":"10.1137\/060654864"},{"key":"ref25","doi-asserted-by":"publisher","DOI":"10.1109\/18.2626"}],"event":{"name":"2021 IEEE Information Theory Workshop (ITW)","start":{"date-parts":[[2021,10,17]]},"location":"Kanazawa, Japan","end":{"date-parts":[[2021,10,21]]}},"container-title":["2021 IEEE Information Theory Workshop (ITW)"],"original-title":[],"link":[{"URL":"http:\/\/xplorestaging.ieee.org\/ielx7\/9611366\/9611357\/09611505.pdf?arnumber=9611505","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2022,5,10]],"date-time":"2022-05-10T16:52:06Z","timestamp":1652201526000},"score":1,"resource":{"primary":{"URL":"https:\/\/ieeexplore.ieee.org\/document\/9611505\/"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2021,10,17]]},"references-count":31,"URL":"https:\/\/doi.org\/10.1109\/itw48936.2021.9611505","relation":{},"subject":[],"published":{"date-parts":[[2021,10,17]]}}}