@article{15254,
  abstract     = {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.},
  author       = {Li, Sijie and Bitar, Rawad and Jaggi, Sidharth and Zhang, Yihan},
  issn         = {2641-8770},
  journal      = {IEEE Journal on Selected Areas in Information Theory},
  number       = {4},
  pages        = {1108--1119},
  publisher    = {IEEE},
  title        = {{Network coding with myopic adversaries}},
  doi          = {10.1109/JSAIT.2021.3126474},
  volume       = {2},
  year         = {2021},
}