Coding Schemes for Line Networks Export

@misc{citeulike:307500, abstract = {We consider a simple network, where a source and destination node are connected with a line of erasure channels. It is well known that in order to achieve the min-cut capacity, the intermediate nodes are required to process the information. We propose coding schemes for this setting, and discuss each scheme in terms of complexity, delay, achievable rate, memory requirement, and adaptability to unknown channel parameters. We also briefly discuss how these schemes can be extended to more general networks.}, archivePrefix = {arXiv}, author = {Pakzad, Payam and Fragouli, Christina and Shokrollahi, Amin}, citeulike-article-id = {307500}, citeulike-linkout-0 = {http://arxiv.org/abs/cs.IT/0508124}, citeulike-linkout-1 = {http://arxiv.org/pdf/cs.IT/0508124}, day = {29}, eprint = {cs.IT/0508124}, keywords = {information-theory, networks}, month = {Aug}, posted-at = {2005-08-30 20:14:21}, priority = {2}, title = {Coding Schemes for Line Networks}, url = {http://arxiv.org/abs/cs.IT/0508124}, year = {2005} }

TY - ELEC ID - citeulike:307500 L3 - citeulike-article-id:307500 N2 - We consider a simple network, where a source and destination node are connected with a line of erasure channels. It is well known that in order to achieve the min-cut capacity, the intermediate nodes are required to process the information. We propose coding schemes for this setting, and discuss each scheme in terms of complexity, delay, achievable rate, memory requirement, and adaptability to unknown channel parameters. We also briefly discuss how these schemes can be extended to more general networks. TI - Coding Schemes for Line Networks KW - information-theory KW - networks AU - Pakzad, Payam AU - Fragouli, Christina AU - Shokrollahi, Amin PY - 2005/Aug/29/ UR - http://arxiv.org/abs/cs.IT/0508124 ER -