Coding Schemes for Line Networks
Information Theory
2016-11-17 v1 Distributed, Parallel, and Cluster Computing
Networking and Internet Architecture
math.IT
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.
Cite
@article{arxiv.cs/0508124,
title = {Coding Schemes for Line Networks},
author = {Payam Pakzad and Christina Fragouli and Amin Shokrollahi},
journal= {arXiv preprint arXiv:cs/0508124},
year = {2016}
}
Comments
To appear in the proceedings of the 2005 IEEE international Symposium on Information Theory, Adelaide, Australia, Sept. 4-9, 2005