On the k-pairs problem - Computer Science > Information TheoryReport as inadecuate




On the k-pairs problem - Computer Science > Information Theory - Download this document for free, or read online. Document in PDF available to download.

Abstract: We consider network coding rates for directed and undirected $k$-pairsnetworks. For directed networks, meagerness is known to be an upper bound onnetwork coding rates. We show that network coding rate can be $\Theta|V|$multiplicative factor smaller than meagerness. For the undirected case, we showsome progress in the direction of the $k$-pairs conjecture.



Author: Ali Al-Bashabsheh, Abbas Yongacoglu

Source: https://arxiv.org/







Related documents