@article{fragouli_subtree_2004,
 abstract = {We propose a subtree decomposition method for network coding. This approach enables derivation of tight bounds on the network code alpha- bet size, makes connections with convolutional codes transparent, allows specification of coding operations at network nodes without the knowledge of the overall network topology, and facilitates design of codes which can easily accommodate future changes in the network, such as addition of receivers and loss of links.},
 type={4},
 author = {Fragouli, C. and Soljanin, E.},
 journal = {ISIT},
 tags = {network_coding},
 title = {Subtree {Decomposition} for {Network} {Coding}},
 year = {2004}
}

{"_id":"jJcjTRKCDQQ94vptd","bibbaseid":"fragouli-soljanin-subtreedecompositionfornetworkcoding-2004","authorIDs":["BovhRrwbYouQ7xD9S"],"author_short":["Fragouli, C.","Soljanin, E."],"bibdata":{"bibtype":"article","type":"4","abstract":"We propose a subtree decomposition method for network coding. This approach enables derivation of tight bounds on the network code alpha- bet size, makes connections with convolutional codes transparent, allows specification of coding operations at network nodes without the knowledge of the overall network topology, and facilitates design of codes which can easily accommodate future changes in the network, such as addition of receivers and loss of links.","author":[{"propositions":[],"lastnames":["Fragouli"],"firstnames":["C."],"suffixes":[]},{"propositions":[],"lastnames":["Soljanin"],"firstnames":["E."],"suffixes":[]}],"journal":"ISIT","tags":"network_coding","title":"Subtree Decomposition for Network Coding","year":"2004","bibtex":"@article{fragouli_subtree_2004,\n abstract = {We propose a subtree decomposition method for network coding. This approach enables derivation of tight bounds on the network code alpha- bet size, makes connections with convolutional codes transparent, allows specification of coding operations at network nodes without the knowledge of the overall network topology, and facilitates design of codes which can easily accommodate future changes in the network, such as addition of receivers and loss of links.},\n type={4},\n author = {Fragouli, C. and Soljanin, E.},\n journal = {ISIT},\n tags = {network_coding},\n title = {Subtree {Decomposition} for {Network} {Coding}},\n year = {2004}\n}\n\n","author_short":["Fragouli, C.","Soljanin, E."],"key":"fragouli_subtree_2004","id":"fragouli_subtree_2004","bibbaseid":"fragouli-soljanin-subtreedecompositionfornetworkcoding-2004","role":"author","urls":{},"metadata":{"authorlinks":{"fragouli, c":"https://bibbase.org/show?bib=https%3A%2F%2Fbibbase.org%2Fnetwork%2Ffiles%2F52xaJNXvSgauGDmZR&msg=embed&noBootstrap=1"}},"downloads":0},"bibtype":"article","biburl":"https://bibbase.org/network/files/52xaJNXvSgauGDmZR","creationDate":"2020-11-13T02:21:59.547Z","downloads":0,"keywords":[],"search_terms":["subtree","decomposition","network","coding","fragouli","soljanin"],"title":"Subtree Decomposition for Network Coding","year":2004,"dataSources":["ZyBHKCcCyS7Qk9n3w","2BHqTGHtDg7BjRAJQ","XpqzCLvCgsYBqbTpK","QNNZyNQzfeETJyTbL","Z6bBhKezwKd3pPWRc"]}