Coding Schemes for Line NetworksReport as inadecuate




Coding Schemes for Line Networks - Download this document for free, or read online. Document in PDF available to download.

Presented at: IEEE International Symposium on Information Theory (ISIT'05), Adelaide, Australia, 4-9 September, 2005 Publication date: 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.

Reference ARNI-CONF-2006-009





Author: Pakzad, P.; Fragouli, C.; Shokrollahi, A.

Source: https://infoscience.epfl.ch/record/98362?ln=en







Related documents