Mission impossible: Computing the network coding capacity region
| dc.creator | Chan, Terence | |
| dc.creator | Grant, Alex | |
| dc.date | 2008-01-31 | |
| dc.date.accessioned | 2026-07-07T09:18:12Z | |
| dc.date.available | 2026-07-07T09:18:12Z | |
| dc.description | One of the main theoretical motivations for the emerging area of network coding is the achievability of the max-flow/min-cut rate for single source multicast. This can exceed the rate achievable with routing alone, and is achievable with linear network codes. The multi-source problem is more complicated. Computation of its capacity region is equivalent to determination of the set of all entropy functions $Γ^*$, which is non-polyhedral. The aim of this paper is to demonstrate that this difficulty can arise even in single source problems. In particular, for single source networks with hierarchical sink requirements, and for single source networks with secrecy constraints. In both cases, we exhibit networks whose capacity regions involve $Γ^*$. As in the multi-source case, linear codes are insufficient. | |
| dc.identifier | https://arxiv.org/abs/0802.0030 | |
| dc.identifier | http://arxiv.org/abs/0802.0030 | |
| dc.identifier.uri | http://salesiana.dossiersoluciones.com/handle/123456789/153939 | |
| dc.subject | Information Theory | |
| dc.title | Mission impossible: Computing the network coding capacity region | |
| dc.type | text |