• DocumentCode
    3280198
  • Title

    Capacity of broadcast erasure networks using spatial network coding

  • Author

    Salmasi, Mehrdad ; Golestani, S. Jamaloddin

  • Author_Institution
    ECE Dept., Isfahan Univ. of Technol., Isfahan
  • fYear
    2008
  • fDate
    7-10 Dec. 2008
  • Firstpage
    1
  • Lastpage
    6
  • Abstract
    We study the capacity of a multicast session in point-to-point erasure networks as well as interference-free broadcast erasure networks, under a class of network coding schemes referred to as spatial network coding. In this class of coding, nodes are prohibited from performing coding on successive data units of a link; only combining data units arriving on different incoming links is permitted. We prove that, for both point-to-point and broadcast networks, the capacity of a multicast session is equal to the minimum of the capacities of the constituent unicast sessions. The capacity of a unicast session is equal to the statistical mean of the minimum cut rate of the corresponding random graph, where the notions of graph model and minimum cut rate are extended to apply to broadcast networks.
  • Keywords
    broadcast channels; channel capacity; encoding; multicast communication; broadcast erasure networks; broadcast networks; multicast session; point-to-point network capacity; random graph; spatial network coding; Broadcast technology; Broadcasting; Decoding; Electronic mail; Information theory; Interference; Network coding; Probability distribution; Statistics; Unicast;
  • fLanguage
    English
  • Publisher
    ieee
  • Conference_Titel
    Information Theory and Its Applications, 2008. ISITA 2008. International Symposium on
  • Conference_Location
    Auckland
  • Print_ISBN
    978-1-4244-2068-1
  • Electronic_ISBN
    978-1-4244-2069-8
  • Type

    conf

  • DOI
    10.1109/ISITA.2008.4895512
  • Filename
    4895512