On the capacity of non-coherent network coding. Jafari Siavoshani, M., Mohajer, S., Fragouli, C., & Diggavi, S. N. In Information Theory, 2009. ISIT 2009. IEEE International Symposium on, pages 273–277, July, 2009. doi abstract bibtex 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 ges 1 receivers can also be achieved using packets of length logN 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.
@inproceedings{jafari_siavoshani_capacity_2009,
abstract = {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 ges 1 receivers can also be achieved using packets of length logN 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.},
type={4},
author = {Jafari Siavoshani, Mahdi and Mohajer, S. and Fragouli, C. and Diggavi, Suhas N.},
booktitle = {Information {Theory}, 2009. {ISIT} 2009. {IEEE} {International} {Symposium} on},
doi = {10.1109/isit.2009.5205851},
keywords = {multicast theorem, noncoherent network coding, packet length, single bit routing, source coding, telecommunication network routingmin-cut value towards},
month = {July},
pages = {273--277},
tags = {network_coding,wireless},
title = {On the capacity of non-coherent network coding},
year = {2009}
}
Downloads: 0
{"_id":"iT7sebfcM8DEr2Z8J","bibbaseid":"jafarisiavoshani-mohajer-fragouli-diggavi-onthecapacityofnoncoherentnetworkcoding-2009","author_short":["Jafari Siavoshani, M.","Mohajer, S.","Fragouli, C.","Diggavi, S. N."],"bibdata":{"bibtype":"inproceedings","type":"4","abstract":"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 ges 1 receivers can also be achieved using packets of length logN 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.","author":[{"propositions":[],"lastnames":["Jafari","Siavoshani"],"firstnames":["Mahdi"],"suffixes":[]},{"propositions":[],"lastnames":["Mohajer"],"firstnames":["S."],"suffixes":[]},{"propositions":[],"lastnames":["Fragouli"],"firstnames":["C."],"suffixes":[]},{"propositions":[],"lastnames":["Diggavi"],"firstnames":["Suhas","N."],"suffixes":[]}],"booktitle":"Information Theory, 2009. ISIT 2009. IEEE International Symposium on","doi":"10.1109/isit.2009.5205851","keywords":"multicast theorem, noncoherent network coding, packet length, single bit routing, source coding, telecommunication network routingmin-cut value towards","month":"July","pages":"273–277","tags":"network_coding,wireless","title":"On the capacity of non-coherent network coding","year":"2009","bibtex":"@inproceedings{jafari_siavoshani_capacity_2009,\n abstract = {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 ges 1 receivers can also be achieved using packets of length logN 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.},\n type={4},\n author = {Jafari Siavoshani, Mahdi and Mohajer, S. and Fragouli, C. and Diggavi, Suhas N.},\n booktitle = {Information {Theory}, 2009. {ISIT} 2009. {IEEE} {International} {Symposium} on},\n doi = {10.1109/isit.2009.5205851},\n keywords = {multicast theorem, noncoherent network coding, packet length, single bit routing, source coding, telecommunication network routingmin-cut value towards},\n month = {July},\n pages = {273--277},\n tags = {network_coding,wireless},\n title = {On the capacity of non-coherent network coding},\n year = {2009}\n}\n\n","author_short":["Jafari Siavoshani, M.","Mohajer, S.","Fragouli, C.","Diggavi, S. N."],"key":"jafari_siavoshani_capacity_2009","id":"jafari_siavoshani_capacity_2009","bibbaseid":"jafarisiavoshani-mohajer-fragouli-diggavi-onthecapacityofnoncoherentnetworkcoding-2009","role":"author","urls":{},"keyword":["multicast theorem","noncoherent network coding","packet length","single bit routing","source coding","telecommunication network routingmin-cut value towards"],"metadata":{"authorlinks":{}},"html":""},"bibtype":"inproceedings","biburl":"https://s3-us-west-2.amazonaws.com/us-west-2.files.campus.edublogs.org/research.seas.ucla.edu/dist/3/23/files/2023/10/arni_db.bib","dataSources":["ZyBHKCcCyS7Qk9n3w","hicKnsKYNEFXC4CgH","jxCYzXXYRqw2fiEXQ","wCByFFrQMyRwfzrJ6","yuqM5ah4HMsTyDrMa","YaM87hGQiepg5qijZ","n9wmfkt5w8CPqCepg","soj2cS6PgG8NPmWGr","FaDBDiyFAJY5pL28h","ycfdiwWPzC2rE6H77","2BHqTGHtDg7BjRAJQ","XpqzCLvCgsYBqbTpK","QNNZyNQzfeETJyTbL","Z6bBhKezwKd3pPWRc"],"keywords":["multicast theorem","noncoherent network coding","packet length","single bit routing","source coding","telecommunication network routingmin-cut value towards"],"search_terms":["capacity","non","coherent","network","coding","jafari siavoshani","mohajer","fragouli","diggavi"],"title":"On the capacity of non-coherent network coding","year":2009}