Network Coding as a Coloring Problem. Fragouli, C., Soljanin, E., & Shokrollahi, A. *CISS*, 2004. abstract bibtex We consider a multicast configuration with two sources, and translate the network code design problem to vertex coloring of an appropriately defined graph. This observation enables to derive code design algorithms and alphabet size bounds, as well as establish a connection with a number of well-known results from discrete mathematics that increase our insight in the different trade-offs possible for network coding.

@article{fragouli_network_2004,
abstract = {We consider a multicast configuration with two sources, and translate the network code design problem to vertex coloring of an appropriately defined graph. This observation enables to derive code design algorithms and alphabet size bounds, as well as establish a connection with a number of well-known results from discrete mathematics that increase our insight in the different trade-offs possible for network coding.},
type={4},
author = {Fragouli, C. and Soljanin, E. and Shokrollahi, A.},
journal = {CISS},
tags = {network_coding},
title = {Network {Coding} as a {Coloring} {Problem}},
year = {2004}
}

Downloads: 0

{"_id":"6c5P8xENf3pJvCRwR","bibbaseid":"fragouli-soljanin-shokrollahi-networkcodingasacoloringproblem-2004","authorIDs":["BovhRrwbYouQ7xD9S"],"author_short":["Fragouli, C.","Soljanin, E.","Shokrollahi, A."],"bibdata":{"bibtype":"article","type":"4","abstract":"We consider a multicast configuration with two sources, and translate the network code design problem to vertex coloring of an appropriately defined graph. This observation enables to derive code design algorithms and alphabet size bounds, as well as establish a connection with a number of well-known results from discrete mathematics that increase our insight in the different trade-offs possible for network coding.","author":[{"propositions":[],"lastnames":["Fragouli"],"firstnames":["C."],"suffixes":[]},{"propositions":[],"lastnames":["Soljanin"],"firstnames":["E."],"suffixes":[]},{"propositions":[],"lastnames":["Shokrollahi"],"firstnames":["A."],"suffixes":[]}],"journal":"CISS","tags":"network_coding","title":"Network Coding as a Coloring Problem","year":"2004","bibtex":"@article{fragouli_network_2004,\n abstract = {We consider a multicast configuration with two sources, and translate the network code design problem to vertex coloring of an appropriately defined graph. This observation enables to derive code design algorithms and alphabet size bounds, as well as establish a connection with a number of well-known results from discrete mathematics that increase our insight in the different trade-offs possible for network coding.},\n type={4},\n author = {Fragouli, C. and Soljanin, E. and Shokrollahi, A.},\n journal = {CISS},\n tags = {network_coding},\n title = {Network {Coding} as a {Coloring} {Problem}},\n year = {2004}\n}\n\n","author_short":["Fragouli, C.","Soljanin, E.","Shokrollahi, A."],"key":"fragouli_network_2004","id":"fragouli_network_2004","bibbaseid":"fragouli-soljanin-shokrollahi-networkcodingasacoloringproblem-2004","role":"author","urls":{},"metadata":{"authorlinks":{"fragouli, c":"https://bibbase.org/show?bib=https%3A%2F%2Fresearch.seas.ucla.edu%2Farni%2Ffiles%2F2019%2F08%2Farni_db.bib&msg=embed&authorFirst=1&nocache=1"}},"html":""},"bibtype":"article","biburl":"https://research.seas.ucla.edu/arni/files/2019/08/arni_db.bib","creationDate":"2020-11-13T02:21:59.540Z","downloads":0,"keywords":[],"search_terms":["network","coding","coloring","problem","fragouli","soljanin","shokrollahi"],"title":"Network Coding as a Coloring Problem","year":2004,"dataSources":["ZyBHKCcCyS7Qk9n3w","ygmYF48R6aSdzH23h"]}