Loading...
conference paper
Coding Schemes for Line Networks
2005
Proceedings of the IEEE International Symposium on Information Theory, ISIT 2005
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.
Loading...
Name
network9.pdf
Access type
openaccess
Size
132.85 KB
Format
Adobe PDF
Checksum (MD5)
7f45c479fcb3fbfb2c2598eebe670e91