• DocumentCode
    2519008
  • Title

    On the k-pairs problem

  • Author

    Al-Bashabsheh, Ali ; Yongacoglu, Abbas

  • Author_Institution
    Sch. of Inf. Technol. & Eng., Univ. of Ottawa, Ottawa, ON
  • fYear
    2008
  • fDate
    6-11 July 2008
  • Firstpage
    1828
  • Lastpage
    1832
  • 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;
  • fLanguage
    English
  • Publisher
    ieee
  • 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
  • Type

    conf

  • DOI
    10.1109/ISIT.2008.4595304
  • Filename
    4595304
    • Link To Document
    https://search.isc.ac/dl/search/defaultta.aspx?DTC=49&DC=2519008