{"volume":69,"intvolume":"        69","year":"2023","keyword":["Computer Science Applications","Information Systems"],"acknowledgement":"The author would like to thank Amitalok J. Budkuley and Sidharth Jaggi for many helpful discussions at the early stage of this work. He would also like to thank Nir Ailon, Qi Cao, and Chandra Nair for discussions on a related problem regarding zero-error binary adder MACs.\r\nThe work of Yihan Zhang was supported by the European Union’s Horizon 2020 Research and Innovation Programme under Grant 682203-ERC-[Inf-Speed-Tradeoff]","author":[{"id":"2ce5da42-b2ea-11eb-bba5-9f264e9d002c","full_name":"Zhang, Yihan","first_name":"Yihan","last_name":"Zhang","orcid":"0000-0002-6465-6258"}],"publication":"IEEE Transactions on Information Theory","page":"4093-4127","doi":"10.1109/tit.2023.3257239","publication_identifier":{"issn":["0018-9448"],"eissn":["1557-9654"]},"external_id":{"arxiv":["2101.12426"]},"citation":{"short":"Y. Zhang, IEEE Transactions on Information Theory 69 (2023) 4093–4127.","ama":"Zhang Y. Zero-error communication over adversarial MACs. <i>IEEE Transactions on Information Theory</i>. 2023;69(7):4093-4127. doi:<a href=\"https://doi.org/10.1109/tit.2023.3257239\">10.1109/tit.2023.3257239</a>","chicago":"Zhang, Yihan. “Zero-Error Communication over Adversarial MACs.” <i>IEEE Transactions on Information Theory</i>. Institute of Electrical and Electronics Engineers, 2023. <a href=\"https://doi.org/10.1109/tit.2023.3257239\">https://doi.org/10.1109/tit.2023.3257239</a>.","ista":"Zhang Y. 2023. Zero-error communication over adversarial MACs. IEEE Transactions on Information Theory. 69(7), 4093–4127.","apa":"Zhang, Y. (2023). Zero-error communication over adversarial MACs. <i>IEEE Transactions on Information Theory</i>. Institute of Electrical and Electronics Engineers. <a href=\"https://doi.org/10.1109/tit.2023.3257239\">https://doi.org/10.1109/tit.2023.3257239</a>","ieee":"Y. Zhang, “Zero-error communication over adversarial MACs,” <i>IEEE Transactions on Information Theory</i>, vol. 69, no. 7. Institute of Electrical and Electronics Engineers, pp. 4093–4127, 2023.","mla":"Zhang, Yihan. “Zero-Error Communication over Adversarial MACs.” <i>IEEE Transactions on Information Theory</i>, vol. 69, no. 7, Institute of Electrical and Electronics Engineers, 2023, pp. 4093–127, doi:<a href=\"https://doi.org/10.1109/tit.2023.3257239\">10.1109/tit.2023.3257239</a>."},"article_type":"original","_id":"14751","language":[{"iso":"eng"}],"date_created":"2024-01-08T13:04:54Z","user_id":"2DF688A6-F248-11E8-B48F-1D18A9856A87","oa_version":"Preprint","oa":1,"scopus_import":"1","publisher":"Institute of Electrical and Electronics Engineers","status":"public","quality_controlled":"1","title":"Zero-error communication over adversarial MACs","day":"01","type":"journal_article","date_updated":"2024-01-09T08:45:24Z","article_processing_charge":"No","month":"07","issue":"7","publication_status":"published","date_published":"2023-07-01T00:00:00Z","abstract":[{"lang":"eng","text":"We consider zero-error communication over a two-transmitter deterministic adversarial multiple access channel (MAC) governed by an adversary who has access to the transmissions of both senders (hence called omniscient ) and aims to maliciously corrupt the communication. None of the encoders, jammer and decoder is allowed to randomize using private or public randomness. This enforces a combinatorial nature of the problem. Our model covers a large family of channels studied in the literature, including all deterministic discrete memoryless noisy or noiseless MACs. In this work, given an arbitrary two-transmitter deterministic omniscient adversarial MAC, we characterize when the capacity region: 1) has nonempty interior (in particular, is two-dimensional); 2) consists of two line segments (in particular, has empty interior); 3) consists of one line segment (in particular, is one-dimensional); 4) or only contains (0,0) (in particular, is zero-dimensional). This extends a recent result by Wang et al. (201 9) from the point-to-point setting to the multiple access setting. Indeed, our converse arguments build upon their generalized Plotkin bound and involve delicate case analysis. One of the technical challenges is to take care of both “joint confusability” and “marginal confusability”. In particular, the treatment of marginal confusability does not follow from the point-to-point results by Wang et al. Our achievability results follow from random coding with expurgation."}],"main_file_link":[{"open_access":"1","url":"https://doi.org/10.48550/arXiv.2101.12426"}],"department":[{"_id":"MaMo"}]}