On the k-pairs problem
| dc.creator | Al-Bashabsheh, Ali | |
| dc.creator | Yongacoglu, Abbas | |
| dc.date | 2008-05-01 | |
| dc.date.accessioned | 2026-07-07T09:36:23Z | |
| dc.date.available | 2026-07-07T09:36:23Z | |
| dc.description | We consider network coding rates for directed and undirected $k$-pairs networks. For directed networks, meagerness is known to be an upper bound on network coding rates. We show that network coding rate can be $Θ(|V|)$ multiplicative factor smaller than meagerness. For the undirected case, we show some progress in the direction of the $k$-pairs conjecture. | |
| dc.description | ISIT 2008 | |
| dc.identifier | https://arxiv.org/abs/0805.0050 | |
| dc.identifier | http://arxiv.org/abs/0805.0050 | |
| dc.identifier.uri | http://salesiana.dossiersoluciones.com/handle/123456789/160099 | |
| dc.subject | Information Theory | |
| dc.title | On the k-pairs problem | |
| dc.type | text |