• DocumentCode
    181672
  • Title

    Maximum multicast throughput by network coding on undirected hypernetworks

  • Author

    Takahashi, H. ; Matsumoto, R. ; Uyematsu, T.

  • Author_Institution
    Dept. of Commun. & Comput. Eng., Tokyo Inst. of Technol., Tokyo, Japan
  • fYear
    2014
  • fDate
    26-29 Oct. 2014
  • Firstpage
    363
  • Lastpage
    367
  • Abstract
    It is known that the problem of the maximum multicast rate by network coding on an undirected network can be formulated as a linear programming problem and the network code with the maximum multicast rate can be constructed from its solution. In this paper, we propose a linear programming formulation of the maximum multicast rate problem on an undirected hypernetwork and reveal how to construct the network code with the maximum multicast rate.
  • Keywords
    linear programming; multicast communication; network coding; network theory (graphs); linear programming problem; maximum multicast rate; maximum multicast throughput; network coding; undirected hypernetworks; Australia; Decoding; Delays; Encoding; Linear programming; Network coding; Routing;
  • fLanguage
    English
  • Publisher
    ieee
  • Conference_Titel
    Information Theory and its Applications (ISITA), 2014 International Symposium on
  • Conference_Location
    Melbourne, VIC
  • Type

    conf

  • Filename
    6979866