{"quality_controlled":"1","language":[{"iso":"eng"}],"article_type":"original","month":"12","publication_identifier":{"eissn":["2641-8770"]},"oa_version":"Preprint","publication":"IEEE Journal on Selected Areas in Information Theory","publisher":"IEEE","author":[{"last_name":"Li","first_name":"Sijie","full_name":"Li, Sijie"},{"first_name":"Rawad","full_name":"Bitar, Rawad","last_name":"Bitar"},{"full_name":"Jaggi, Sidharth","first_name":"Sidharth","last_name":"Jaggi"},{"orcid":"0000-0002-6465-6258","id":"2ce5da42-b2ea-11eb-bba5-9f264e9d002c","full_name":"Zhang, Yihan","first_name":"Yihan","last_name":"Zhang"}],"intvolume":"         2","main_file_link":[{"url":"https://doi.org/10.48550/arXiv.2102.09885","open_access":"1"}],"volume":2,"title":"Network coding with myopic adversaries","citation":{"ama":"Li S, Bitar R, Jaggi S, Zhang Y. Network coding with myopic adversaries. <i>IEEE Journal on Selected Areas in Information Theory</i>. 2021;2(4):1108-1119. doi:<a href=\"https://doi.org/10.1109/JSAIT.2021.3126474\">10.1109/JSAIT.2021.3126474</a>","ista":"Li S, Bitar R, Jaggi S, Zhang Y. 2021. Network coding with myopic adversaries. IEEE Journal on Selected Areas in Information Theory. 2(4), 1108–1119.","short":"S. Li, R. Bitar, S. Jaggi, Y. Zhang, IEEE Journal on Selected Areas in Information Theory 2 (2021) 1108–1119.","chicago":"Li, Sijie, Rawad Bitar, Sidharth Jaggi, and Yihan Zhang. “Network Coding with Myopic Adversaries.” <i>IEEE Journal on Selected Areas in Information Theory</i>. IEEE, 2021. <a href=\"https://doi.org/10.1109/JSAIT.2021.3126474\">https://doi.org/10.1109/JSAIT.2021.3126474</a>.","apa":"Li, S., Bitar, R., Jaggi, S., &#38; Zhang, Y. (2021). Network coding with myopic adversaries. <i>IEEE Journal on Selected Areas in Information Theory</i>. IEEE. <a href=\"https://doi.org/10.1109/JSAIT.2021.3126474\">https://doi.org/10.1109/JSAIT.2021.3126474</a>","mla":"Li, Sijie, et al. “Network Coding with Myopic Adversaries.” <i>IEEE Journal on Selected Areas in Information Theory</i>, vol. 2, no. 4, IEEE, 2021, pp. 1108–19, doi:<a href=\"https://doi.org/10.1109/JSAIT.2021.3126474\">10.1109/JSAIT.2021.3126474</a>.","ieee":"S. Li, R. Bitar, S. Jaggi, and Y. Zhang, “Network coding with myopic adversaries,” <i>IEEE Journal on Selected Areas in Information Theory</i>, vol. 2, no. 4. IEEE, pp. 1108–1119, 2021."},"publication_status":"published","scopus_import":"1","_id":"15254","page":"1108-1119","day":"01","date_published":"2021-12-01T00:00:00Z","user_id":"2DF688A6-F248-11E8-B48F-1D18A9856A87","year":"2021","date_updated":"2024-04-02T08:31:59Z","article_processing_charge":"No","doi":"10.1109/JSAIT.2021.3126474","status":"public","type":"journal_article","acknowledgement":"The work of Rawad Bitar was supported in part by the Technical University of Munich—Institute for Advanced Studies, funded by the German Excellence Initiative and European Union Seventh Framework Programme under Grant 291763. The work of Sidharth Jaggi was supported by the Hong Kong UGC GRF under Grant 14304418, Grant 14300617, and Grant 14313116. The work of Yihan Zhang was supported by the European Union’s Horizon 2020 Research and Innovation Programme under Grant 682203-ERC-[Inf-Speed-Tradeoff]. Preliminary results were presented at IEEE International Symposium on information Theory (ISIT).","oa":1,"external_id":{"arxiv":["2102.09885"]},"department":[{"_id":"MaMo"}],"date_created":"2024-03-31T22:01:13Z","issue":"4","abstract":[{"lang":"eng","text":"We consider the problem of reliable communication over a network containing a hidden myopic adversary who can eavesdrop on some zro links, jam some zwo links, and do both on some zrw links. We provide the first information-theoretically tight characterization of the optimal rate of communication possible under all possible settings of the tuple (zro,zwo,zrw) by providing a novel coding scheme/analysis for a subset of parameter regimes. In particular, our vanishing-error schemes bypass the Network Singleton Bound (which requires a zero-error recovery criteria) in a certain parameter regime where the capacity had been heretofore open. As a direct corollary we also obtain the capacity of the corresponding problem where information-theoretic secrecy against eavesdropping is required in addition to reliable communication."}]}