Coding Schemes for Line Networks

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.

To appear in the proceedings of the 2005 IEEE international Symposium on Information Theory, Adelaide, Australia, Sept. 4-9, 2005

References in corpus (1)

• On Coding for Reliable Communication over Packet Networks

Cited by in corpus (8)

• On Coding for Reliable Communication over Packet Networks
• Minimum-Cost Multicast over Coded Packet Networks
• ARQ for Network Coding
• Batched Sparse Codes
• Throughput and Latency in Finite-Buffer Line Networks
• Minimal Header Overhead for Random Linear Network Coding
• Bits Through Deterministic Relay Cascades with Half-Duplex Constraint
• Energy-Delay Considerations in Coded Packet Flows