@article{chekuri_average_2005,
 abstract = {We analyze a special class of configurations with \$h\$ sources and \$N\$ receivers to demonstrate the throughput benefits of network coding and deterministic code design. We show that the throughput benefits network coding offers can increase proportionally to \${\textbackslash}sqrtN\$, with respect to the average as well as the minimum throughput. We also show that while for this class of configurations there exists a deterministic coding scheme that realizes these benefits using a binary alphabet, randomized coding may require an exponentially large alphabet size.},
 type={4},
 author = {Chekuri, C. and Fragouli, C. and Soljanin, E.},
 journal = {ISIT},
 tags = {network_coding},
 title = {On average throughput benefits and alphabet size in network {Coding}},
 year = {2005}
}

{"_id":"vYK65TkBz7sjd8xiB","bibbaseid":"chekuri-fragouli-soljanin-onaveragethroughputbenefitsandalphabetsizeinnetworkcoding-2005","author_short":["Chekuri, C.","Fragouli, C.","Soljanin, E."],"bibdata":{"bibtype":"article","type":"4","abstract":"We analyze a special class of configurations with $h$ sources and $N$ receivers to demonstrate the throughput benefits of network coding and deterministic code design. We show that the throughput benefits network coding offers can increase proportionally to ${\\}sqrtN$, with respect to the average as well as the minimum throughput. We also show that while for this class of configurations there exists a deterministic coding scheme that realizes these benefits using a binary alphabet, randomized coding may require an exponentially large alphabet size.","author":[{"propositions":[],"lastnames":["Chekuri"],"firstnames":["C."],"suffixes":[]},{"propositions":[],"lastnames":["Fragouli"],"firstnames":["C."],"suffixes":[]},{"propositions":[],"lastnames":["Soljanin"],"firstnames":["E."],"suffixes":[]}],"journal":"ISIT","tags":"network_coding","title":"On average throughput benefits and alphabet size in network Coding","year":"2005","bibtex":"@article{chekuri_average_2005,\n abstract = {We analyze a special class of configurations with \\$h\\$ sources and \\$N\\$ receivers to demonstrate the throughput benefits of network coding and deterministic code design. We show that the throughput benefits network coding offers can increase proportionally to \\${\\textbackslash}sqrtN\\$, with respect to the average as well as the minimum throughput. We also show that while for this class of configurations there exists a deterministic coding scheme that realizes these benefits using a binary alphabet, randomized coding may require an exponentially large alphabet size.},\n type={4},\n author = {Chekuri, C. and Fragouli, C. and Soljanin, E.},\n journal = {ISIT},\n tags = {network_coding},\n title = {On average throughput benefits and alphabet size in network {Coding}},\n year = {2005}\n}\n\n","author_short":["Chekuri, C.","Fragouli, C.","Soljanin, E."],"key":"chekuri_average_2005","id":"chekuri_average_2005","bibbaseid":"chekuri-fragouli-soljanin-onaveragethroughputbenefitsandalphabetsizeinnetworkcoding-2005","role":"author","urls":{},"metadata":{"authorlinks":{}},"html":""},"bibtype":"article","biburl":"https://bibbase.org/network/files/52xaJNXvSgauGDmZR","dataSources":["ZyBHKCcCyS7Qk9n3w","2BHqTGHtDg7BjRAJQ","XpqzCLvCgsYBqbTpK","QNNZyNQzfeETJyTbL","Z6bBhKezwKd3pPWRc"],"keywords":[],"search_terms":["average","throughput","benefits","alphabet","size","network","coding","chekuri","fragouli","soljanin"],"title":"On average throughput benefits and alphabet size in network Coding","year":2005}