Coding Schemes for Discrete Memoryless Multicast Networks with Rate-limited Feedback
Youlong Wu

TL;DR
This paper introduces new coding schemes for discrete memoryless multicast networks with rate-limited feedback, improving upon existing methods like noisy network coding and distributed decode-forward coding, and extends ideas to feedback-free scenarios.
Contribution
The paper proposes novel coding schemes utilizing block-Markov, superposition, and hybrid strategies for multicast networks with feedback, achieving higher rates than prior methods.
Findings
Schemes recover known results for relay channels with feedback.
Proposed schemes outperform noisy network coding in certain settings.
New feedback-free scheme still improves existing bounds for some channels.
Abstract
Coding schemes for discrete memoryless multicast networks (DM-MN) with rate-limited feedback from the receivers and relays to the transmitter are proposed. The schemes improve over the noisy network coding proposed by Lim et al.. For the single relay channel with relay-transmitter feedback, our coding schemes recover Gabbai and Bross's results, and strictly improve on noisy network coding, distributed decode-forward coding proposed by Lim et al., and all known lower bounds on the achievable rates proposed for the setup without feedback. The coding schemes are based on block-Markov coding, superposition coding, sliding-window/backward decoding and hybrid relaying strategies. In our Scheme 1A, the relays and receivers use compress-forward strategy and send the compression indices to the transmitter through the feedback pipes. After obtaining the compression indices through feedback, the…
Peer Reviews
No public reviews on file for this paper yet. If you reviewed it on a platform where reviews are public (OpenReview, ICLR, NeurIPS, ICML), you can paste yours below so the community can read it here.
Videos
No videos yet. Explain this paper in a talk, walkthrough, or lecture? Add one.
