{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,7,5]],"date-time":"2025-07-05T04:48:03Z","timestamp":1751690883384,"version":"3.37.3"},"reference-count":90,"publisher":"Institute of Electrical and Electronics Engineers (IEEE)","issue":"7","license":[{"start":{"date-parts":[[2023,7,1]],"date-time":"2023-07-01T00:00:00Z","timestamp":1688169600000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/ieeexplore.ieee.org\/Xplorehelp\/downloads\/license-information\/IEEE.html"},{"start":{"date-parts":[[2023,7,1]],"date-time":"2023-07-01T00:00:00Z","timestamp":1688169600000},"content-version":"stm-asf","delay-in-days":0,"URL":"https:\/\/doi.org\/10.15223\/policy-029"},{"start":{"date-parts":[[2023,7,1]],"date-time":"2023-07-01T00:00:00Z","timestamp":1688169600000},"content-version":"stm-asf","delay-in-days":0,"URL":"https:\/\/doi.org\/10.15223\/policy-037"}],"funder":[{"name":"European Union\u2019s Horizon 2020 Research and Innovation Programme","award":["682203-ERC-[Inf-Speed-Tradeoff]"],"award-info":[{"award-number":["682203-ERC-[Inf-Speed-Tradeoff]"]}]}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":["IEEE Trans. Inform. Theory"],"published-print":{"date-parts":[[2023,7]]},"DOI":"10.1109\/tit.2023.3257239","type":"journal-article","created":{"date-parts":[[2023,3,14]],"date-time":"2023-03-14T17:27:00Z","timestamp":1678814820000},"page":"4093-4127","source":"Crossref","is-referenced-by-count":1,"title":["Zero-Error Communication Over Adversarial MACs"],"prefix":"10.1109","volume":"69","author":[{"ORCID":"https:\/\/orcid.org\/0000-0002-6465-6258","authenticated-orcid":false,"given":"Yihan","family":"Zhang","sequence":"first","affiliation":[{"name":"Institute of Science and Technology Austria, Klosterneuburg, Austria"}],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"263","reference":[{"key":"ref13","doi-asserted-by":"publisher","DOI":"10.1002\/j.1538-7305.1948.tb01338.x"},{"key":"ref57","doi-asserted-by":"publisher","DOI":"10.1109\/TIT.2019.2893234"},{"key":"ref12","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-319-53139-7"},{"key":"ref56","article-title":"Zero-error communication over adder MAC","author":"gu","year":"2018","journal-title":"arXiv 1809 07364"},{"key":"ref15","doi-asserted-by":"publisher","DOI":"10.1109\/TIT.2013.2276077"},{"journal-title":"Lectures on Multiple Access Channels","year":"2005","author":"gy\u00f6rfi","key":"ref59"},{"key":"ref14","doi-asserted-by":"publisher","DOI":"10.1109\/TIT.2010.2043769"},{"key":"ref58","doi-asserted-by":"publisher","DOI":"10.1134\/S0032946016040025"},{"key":"ref53","doi-asserted-by":"publisher","DOI":"10.1109\/ISIT.2006.262057"},{"key":"ref52","first-page":"3","article-title":"On the number of correctable errors in the transmission over the binary symmetric channel with feedback","volume":"12","author":"zigangirov","year":"1976","journal-title":"Probl Peredachi Inf"},{"key":"ref11","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-319-12523-7"},{"key":"ref55","first-page":"299","article-title":"A survey of new results in coding with feedback and searching with lies","volume":"17","author":"deppe","year":"2008","journal-title":"Information and Communication Security"},{"key":"ref10","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-319-05479-7"},{"key":"ref54","first-page":"27","author":"deppe","year":"2007","journal-title":"Coding With Feedback and Searching With Lies"},{"key":"ref17","doi-asserted-by":"publisher","DOI":"10.1109\/TIT.2014.2371026"},{"key":"ref16","doi-asserted-by":"publisher","DOI":"10.1109\/TIT.2015.2411256"},{"key":"ref19","doi-asserted-by":"publisher","DOI":"10.1109\/TIT.2022.3151711"},{"key":"ref18","first-page":"3013","article-title":"Gaussian multiple and random access in the finite blocklength regime","author":"yavas","year":"2020","journal-title":"Proc IEEE Int Symp Inf Theory"},{"key":"ref51","first-page":"61","article-title":"Block coding for the binary symmetric channel with noiseless, delayless feedback","author":"berlekamp","year":"1968","journal-title":"Error-Correcting Codes"},{"key":"ref50","doi-asserted-by":"publisher","DOI":"10.1109\/ISIT.2019.8849728"},{"key":"ref90","doi-asserted-by":"publisher","DOI":"10.1109\/TIT.2018.2868957"},{"key":"ref46","doi-asserted-by":"publisher","DOI":"10.1109\/TAC.2021.3120674"},{"key":"ref45","first-page":"2108","article-title":"An explicit formula for the zeroerror feedback capacity of a class of finite-state additive noise channels","author":"saberi","year":"2020","journal-title":"Proc IEEE Int Symp Inf Theory"},{"key":"ref89","first-page":"123","article-title":"Application of Hadamard matrices on coding problem","volume":"5","author":"levenshtein","year":"1961","journal-title":"Probl Cybern"},{"key":"ref48","doi-asserted-by":"publisher","DOI":"10.1109\/ITW46852.2021.9457645"},{"key":"ref47","doi-asserted-by":"publisher","DOI":"10.1109\/ISIT.2019.8849743"},{"key":"ref42","doi-asserted-by":"publisher","DOI":"10.1109\/ISIT44484.2020.9174102"},{"key":"ref86","doi-asserted-by":"publisher","DOI":"10.1109\/ISIT44484.2020.9174487"},{"key":"ref41","doi-asserted-by":"publisher","DOI":"10.1109\/ITW44776.2019.8989045"},{"key":"ref85","article-title":"Sufficiently myopic adversaries are blind","author":"dey","year":"2016","journal-title":"arXiv 1610 01287"},{"key":"ref44","doi-asserted-by":"publisher","DOI":"10.1016\/j.ifacol.2018.12.046"},{"journal-title":"Coding Theory the Essentials","year":"2012","author":"guruswami","key":"ref88"},{"key":"ref43","doi-asserted-by":"publisher","DOI":"10.1109\/CDC.2012.6425874"},{"key":"ref87","doi-asserted-by":"publisher","DOI":"10.1109\/TIT.2022.3167554"},{"key":"ref49","doi-asserted-by":"publisher","DOI":"10.1109\/TIT.2016.2647602"},{"key":"ref8","doi-asserted-by":"crossref","first-page":"229","DOI":"10.1016\/B978-0-12-010904-3.50011-7","article-title":"Some advances in broadcast channels","volume":"4","author":"cover","year":"1975","journal-title":"Advances in Communication Systems"},{"key":"ref7","doi-asserted-by":"publisher","DOI":"10.1017\/CBO9780511921889"},{"key":"ref9","doi-asserted-by":"publisher","DOI":"10.1109\/TIT.1974.1055171"},{"key":"ref4","doi-asserted-by":"publisher","DOI":"10.1214\/aop\/1176996549"},{"key":"ref3","first-page":"23","article-title":"Multi-way communication channels","author":"ahlswede","year":"1973","journal-title":"Proc 2nd Int Symp Inf Theory"},{"key":"ref6","doi-asserted-by":"publisher","DOI":"10.1002\/j.1538-7305.1973.tb02004.x"},{"key":"ref5","doi-asserted-by":"publisher","DOI":"10.1109\/TIT.1973.1054960"},{"key":"ref82","doi-asserted-by":"publisher","DOI":"10.1109\/TIT.2016.2608900"},{"key":"ref81","doi-asserted-by":"publisher","DOI":"10.1109\/TIT.2013.2242514"},{"key":"ref40","doi-asserted-by":"publisher","DOI":"10.1109\/TAC.2013.2241491"},{"key":"ref84","doi-asserted-by":"publisher","DOI":"10.1109\/CIG.2010.5592896"},{"key":"ref83","doi-asserted-by":"publisher","DOI":"10.1109\/ISIT44484.2020.9173978"},{"key":"ref80","doi-asserted-by":"publisher","DOI":"10.1109\/ISIT45174.2021.9518009"},{"key":"ref35","doi-asserted-by":"publisher","DOI":"10.1109\/ISIT44484.2020.9174073"},{"key":"ref79","doi-asserted-by":"publisher","DOI":"10.3390\/e21060575"},{"key":"ref34","doi-asserted-by":"publisher","DOI":"10.1109\/TIT.2017.2688378"},{"key":"ref78","doi-asserted-by":"publisher","DOI":"10.1134\/S0032946018030018"},{"key":"ref37","doi-asserted-by":"publisher","DOI":"10.1007\/978-94-017-2973-4_7"},{"key":"ref36","first-page":"385","article-title":"Certain asymptotic characteristics of completely bounded metric spaces","volume":"108","author":"kolmogorov","year":"1956","journal-title":"Doklady Akademii Nauk"},{"key":"ref31","doi-asserted-by":"publisher","DOI":"10.1109\/ISIT.2015.7282660"},{"key":"ref75","doi-asserted-by":"publisher","DOI":"10.1109\/TIT.2017.2725271"},{"key":"ref30","doi-asserted-by":"publisher","DOI":"10.1109\/ALLERTON.2014.7028562"},{"key":"ref74","doi-asserted-by":"crossref","first-page":"333","DOI":"10.3934\/amc.2016009","article-title":"Arbitrarily varying multiple access channels with conferencing encoders: List decoding and finite coordination resources","volume":"10","author":"boche","year":"2016","journal-title":"Adv Math Commun"},{"key":"ref33","doi-asserted-by":"publisher","DOI":"10.1109\/ISIT.2018.8437657"},{"key":"ref77","doi-asserted-by":"publisher","DOI":"10.1109\/TIT.2011.2178153"},{"key":"ref32","doi-asserted-by":"publisher","DOI":"10.1109\/TIT.2017.2760620"},{"key":"ref76","doi-asserted-by":"publisher","DOI":"10.1109\/18.568692"},{"key":"ref2","first-page":"611","article-title":"Two-way communication channels","author":"shannon","year":"1961","journal-title":"Proc 4th Berkeley Symp Math Statist Probab"},{"key":"ref1","doi-asserted-by":"publisher","DOI":"10.1109\/ISIT45174.2021.9518113"},{"key":"ref39","doi-asserted-by":"publisher","DOI":"10.1109\/ICCA.2011.6138072"},{"key":"ref38","doi-asserted-by":"publisher","DOI":"10.1109\/ISIT.2019.8849324"},{"key":"ref71","doi-asserted-by":"publisher","DOI":"10.1109\/TIT.2012.2229779"},{"journal-title":"Ramsey Theory","year":"2013","author":"graham","key":"ref70"},{"key":"ref73","doi-asserted-by":"publisher","DOI":"10.1109\/TIT.2011.2119830"},{"key":"ref72","doi-asserted-by":"publisher","DOI":"10.1007\/BF00533715"},{"key":"ref24","doi-asserted-by":"publisher","DOI":"10.1109\/ISIT.2019.8849491"},{"key":"ref68","first-page":"17","article-title":"On a bipartite form of the Ramsey problem","author":"beineke","year":"1976","journal-title":"Proc Brit Combinat Conf"},{"key":"ref23","doi-asserted-by":"publisher","DOI":"10.1109\/18.749024"},{"key":"ref67","doi-asserted-by":"publisher","DOI":"10.1109\/18.370123"},{"key":"ref26","doi-asserted-by":"publisher","DOI":"10.1109\/TIT.1979.1055985"},{"key":"ref25","doi-asserted-by":"publisher","DOI":"10.1109\/TSP.2020.2993165"},{"key":"ref69","doi-asserted-by":"publisher","DOI":"10.1007\/BF00383760"},{"key":"ref20","first-page":"11","article-title":"Maximal error capacity regions are smaller than average error capacity regions for multi-user channels","volume":"7","author":"dueck","year":"1978","journal-title":"Problems Control Inf Theory"},{"key":"ref64","first-page":"1587","article-title":"Quadratically constrained twoway adversarial channels","author":"zhang","year":"2020","journal-title":"Proc IEEE Int Symp Inf Theory (ISIT)"},{"key":"ref63","doi-asserted-by":"publisher","DOI":"10.1109\/TIT.2013.2291231"},{"key":"ref22","doi-asserted-by":"publisher","DOI":"10.1109\/18.61125"},{"key":"ref66","doi-asserted-by":"publisher","DOI":"10.1109\/18.2598"},{"key":"ref21","doi-asserted-by":"publisher","DOI":"10.1109\/18.2627"},{"key":"ref65","doi-asserted-by":"publisher","DOI":"10.1007\/BF00533053"},{"key":"ref28","doi-asserted-by":"publisher","DOI":"10.1109\/ALLERTON.2016.7852296"},{"key":"ref27","doi-asserted-by":"publisher","DOI":"10.1109\/TIT.1956.1056798"},{"key":"ref29","doi-asserted-by":"publisher","DOI":"10.3390\/e23111518"},{"key":"ref60","first-page":"7","article-title":"Lecture notes on information theory","volume":"6","author":"polyanskiy","year":"2014","journal-title":"Lect Notes ECE563"},{"key":"ref62","doi-asserted-by":"publisher","DOI":"10.1109\/ITA50056.2020.9244978"},{"key":"ref61","doi-asserted-by":"publisher","DOI":"10.1109\/18.720546"}],"container-title":["IEEE Transactions on Information Theory"],"original-title":[],"link":[{"URL":"http:\/\/xplorestaging.ieee.org\/ielx7\/18\/10155402\/10068554.pdf?arnumber=10068554","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2023,7,10]],"date-time":"2023-07-10T19:03:43Z","timestamp":1689015823000},"score":1,"resource":{"primary":{"URL":"https:\/\/ieeexplore.ieee.org\/document\/10068554\/"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2023,7]]},"references-count":90,"journal-issue":{"issue":"7"},"URL":"https:\/\/doi.org\/10.1109\/tit.2023.3257239","relation":{},"ISSN":["0018-9448","1557-9654"],"issn-type":[{"type":"print","value":"0018-9448"},{"type":"electronic","value":"1557-9654"}],"subject":[],"published":{"date-parts":[[2023,7]]}}}