Coding Schemes for Line Networks
Payam Pakzad, Christina Fragouli, Amin Shokrollahi
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.
Create a lesson
Related papers
Distributed Consensus, Optimization, and Learning under Communication Constraints
Zheng Chen, Nicolò Michelusi, Themistoklis Charalambous et al.
Energy-Accumulate-Then-Act Backscatter Communications With Retransmission Under Imperfect Feedback Detection
Rui Xu, Yinghui Ye, Guangyue Lu et al.
The Exact Memory-Rate Tradeoff for Three-User Secure Coded Caching
Han Fang, Nan Liu, Wei Kang
Cross-Modal Semantic Successive Refinement for Generative Image Communication over Underwater Acoustic Channels
Xu Pei, Bin Wang, Guangxu Zhu et al.
Fano's Inequality and Channel Capacity in the Individual-Sequence Regime
Neri Merhav
Exact Transport-Information Correspondence for Distribution-Adaptive Discretization
Koretaka Yuge