Capacity of Non-Separable Networks with Restricted Adversaries
Fuente:
arXiv
Gespeichert in:
| Hauptverfasser: | , , , |
|---|---|
| Format: | Preprint |
| Veröffentlicht: |
2026
|
| Schlagworte: | |
| Online-Zugang: | |
| Tags: |
Tag hinzufügen
Keine Tags, Fügen Sie den ersten Tag hinzu!
|
| _version_ | 1866910046298832896 |
|---|---|
| author | Hojny, Christopher Kılıç, Altan B. Kurz, Sascha Ravagnani, Alberto |
| author_facet | Hojny, Christopher Kılıç, Altan B. Kurz, Sascha Ravagnani, Alberto |
| contents | This paper investigates the problem of single-source multicasting over a communication network in the presence of restricted adversaries. When the adversary is constrained to operate only on a prescribed subset of edges, classical cut-set bounds are no longer tight, and achieving capacity typically requires a joint design of the outer code and the inner (network) code. This stands in sharp contrast with the case of unrestricted adversaries, where capacity can be achieved by combining linear network coding with appropriate rank-metric outer codes. Building on the framework of network decoding, we determine the exact one-shot capacity of one of the fundamental families of 2-level networks introduced in [4], and we improve the best currently known lower bounds for another such family. In addition, we introduce a new family of networks that generalizes several known examples, and derive partial capacity results that illustrate a variety of phenomena that arise specifically in the restricted-adversary setting. Finally, we investigate the concept of separability of networks with respect to both the rank metric and the Hamming metric. |
| format | Preprint |
| id |
arxiv_https___arxiv_org_abs_2603_08246 |
| institution | arXiv |
| publishDate | 2026 |
| record_format | arxiv |
| spellingShingle | Capacity of Non-Separable Networks with Restricted Adversaries Hojny, Christopher Kılıç, Altan B. Kurz, Sascha Ravagnani, Alberto Information Theory Optimization and Control This paper investigates the problem of single-source multicasting over a communication network in the presence of restricted adversaries. When the adversary is constrained to operate only on a prescribed subset of edges, classical cut-set bounds are no longer tight, and achieving capacity typically requires a joint design of the outer code and the inner (network) code. This stands in sharp contrast with the case of unrestricted adversaries, where capacity can be achieved by combining linear network coding with appropriate rank-metric outer codes. Building on the framework of network decoding, we determine the exact one-shot capacity of one of the fundamental families of 2-level networks introduced in [4], and we improve the best currently known lower bounds for another such family. In addition, we introduce a new family of networks that generalizes several known examples, and derive partial capacity results that illustrate a variety of phenomena that arise specifically in the restricted-adversary setting. Finally, we investigate the concept of separability of networks with respect to both the rank metric and the Hamming metric. |
| title | Capacity of Non-Separable Networks with Restricted Adversaries |
| topic | Information Theory Optimization and Control |
| url | https://arxiv.org/abs/2603.08246 |