@article{fragouli_connection_2004,
 abstract = {The min-cut, max-flow theorem states that a source node can send a commodity through a network to a sink node at the rate determined by the flow of the min-cut separating the source and the sink. Recently it has been shown that by liner re-encoding at nodes in communications networks, the min-cut rate can be also achieved in multicasting to several sinks. In this paper we discuss connections between such coding schemes and convolutional codes. We propose a method to simplify the convolutionalencoder design that is based on a subtree decompositionof the network line graph, describe the structure of the associated matrices, investigate methods to reduce decoding complexity and discuss possible binary implementation.},
 type={4},
 author = {Fragouli, C. and Soljanin, E.},
 journal = {ICC},
 tags = {network_coding},
 title = {A {Connection} between {Network} {Coding} and {Convolutional} {Codes}},
 year = {2004}
}

{"_id":"cuEWGQcng2MoMQ4Hp","bibbaseid":"fragouli-soljanin-aconnectionbetweennetworkcodingandconvolutionalcodes-2004","authorIDs":["BovhRrwbYouQ7xD9S"],"author_short":["Fragouli, C.","Soljanin, E."],"bibdata":{"bibtype":"article","type":"4","abstract":"The min-cut, max-flow theorem states that a source node can send a commodity through a network to a sink node at the rate determined by the flow of the min-cut separating the source and the sink. Recently it has been shown that by liner re-encoding at nodes in communications networks, the min-cut rate can be also achieved in multicasting to several sinks. In this paper we discuss connections between such coding schemes and convolutional codes. We propose a method to simplify the convolutionalencoder design that is based on a subtree decompositionof the network line graph, describe the structure of the associated matrices, investigate methods to reduce decoding complexity and discuss possible binary implementation.","author":[{"propositions":[],"lastnames":["Fragouli"],"firstnames":["C."],"suffixes":[]},{"propositions":[],"lastnames":["Soljanin"],"firstnames":["E."],"suffixes":[]}],"journal":"ICC","tags":"network_coding","title":"A Connection between Network Coding and Convolutional Codes","year":"2004","bibtex":"@article{fragouli_connection_2004,\n abstract = {The min-cut, max-flow theorem states that a source node can send a commodity through a network to a sink node at the rate determined by the flow of the min-cut separating the source and the sink. Recently it has been shown that by liner re-encoding at nodes in communications networks, the min-cut rate can be also achieved in multicasting to several sinks. In this paper we discuss connections between such coding schemes and convolutional codes. We propose a method to simplify the convolutionalencoder design that is based on a subtree decompositionof the network line graph, describe the structure of the associated matrices, investigate methods to reduce decoding complexity and discuss possible binary implementation.},\n type={4},\n author = {Fragouli, C. and Soljanin, E.},\n journal = {ICC},\n tags = {network_coding},\n title = {A {Connection} between {Network} {Coding} and {Convolutional} {Codes}},\n year = {2004}\n}\n\n","author_short":["Fragouli, C.","Soljanin, E."],"key":"fragouli_connection_2004","id":"fragouli_connection_2004","bibbaseid":"fragouli-soljanin-aconnectionbetweennetworkcodingandconvolutionalcodes-2004","role":"author","urls":{},"metadata":{"authorlinks":{"fragouli, c":"https://bibbase.org/show?bib=https%3A%2F%2Fbibbase.org%2Fnetwork%2Ffiles%2F52xaJNXvSgauGDmZR&noBootstrap=1&authorFirst=1&nocache=1&fullnames=1&theme=bullets&group0=year&group1=type&owner="}},"downloads":0},"bibtype":"article","biburl":"https://bibbase.org/network/files/52xaJNXvSgauGDmZR","creationDate":"2020-11-13T02:21:59.536Z","downloads":0,"keywords":[],"search_terms":["connection","between","network","coding","convolutional","codes","fragouli","soljanin"],"title":"A Connection between Network Coding and Convolutional Codes","year":2004,"dataSources":["ZyBHKCcCyS7Qk9n3w","2BHqTGHtDg7BjRAJQ","XpqzCLvCgsYBqbTpK","QNNZyNQzfeETJyTbL","Z6bBhKezwKd3pPWRc"]}