Title :
On the k-pairs problem
Author :
Al-Bashabsheh, Ali ; Yongacoglu, Abbas
Author_Institution :
Sch. of Inf. Technol. & Eng., Univ. of Ottawa, Ottawa, ON
Abstract :
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 ominus(|V|) multiplicative factor smaller than meagerness. For the undirected case, we show some progress in the direction of the k-pairs conjecture.
Keywords :
directed graphs; encoding; directed gragh; k-pair problem; multiplicative factor; network coding; Chemicals; Information technology; Network coding; Routing; Sufficient conditions; Throughput; Transportation; Unicast; Upper bound;
Conference_Titel :
Information Theory, 2008. ISIT 2008. IEEE International Symposium on
Conference_Location :
Toronto, ON
Print_ISBN :
978-1-4244-2256-2
Electronic_ISBN :
978-1-4244-2257-9
DOI :
10.1109/ISIT.2008.4595304
