Repository logo

Infoscience

  • English
  • French
Log In
Logo EPFL, École polytechnique fédérale de Lausanne

Infoscience

  • English
  • French
Log In
  1. Home
  2. Academic and Research Output
  3. Conferences, Workshops, Symposiums, and Seminars
  4. On the Capacity of Non-Coherent Network Coding
 
conference paper

On the Capacity of Non-Coherent Network Coding

Jafari, Mahdi
•
Mohajer, Soheil  
•
Fragouli, Christina  
Show more
2009
2009 Ieee International Symposium On Information Theory, Vols 1- 4
IEEE International Symposium on Information Theory (ISIT 2009)

The min-cut value towards a single receiver in a network with unit capacity edges can be achieved by routing a single bit. The multicast theorem in network coding shows that, the common min-cut value towards N >= 1 receivers can also be achieved using packets of length log N bits, if the operations the intermediate nodes perform are deterministically known at the receivers. We here calculate the capacity in the case where these operations are unknown, and characterize how the capacity depends on the min-cut value and the packet length.

  • Files
  • Details
  • Metrics
Loading...
Thumbnail Image
Name

isit09_noncoh.pdf

Access type

openaccess

Size

2.48 MB

Format

Adobe PDF

Checksum (MD5)

c98db5ecb03aa4294e8182b77a61c1d8

Logo EPFL, École polytechnique fédérale de Lausanne
  • Contact
  • infoscience@epfl.ch

  • Follow us on Facebook
  • Follow us on Instagram
  • Follow us on LinkedIn
  • Follow us on X
  • Follow us on Youtube
AccessibilityLegal noticePrivacy policyCookie settingsEnd User AgreementGet helpFeedback

Infoscience is a service managed and provided by the Library and IT Services of EPFL. © EPFL, tous droits réservés