Universal and Robust Distributed Network Codes
Tracey Ho, Sidharth Jaggi, Svitlana Vyetrenko, Lingxiao Xia

TL;DR
This paper introduces universal, robust, and distributed linear network coding schemes that adapt to network changes without prior knowledge of global parameters, ensuring efficient, error-free communication.
Contribution
It presents the first universal and robust distributed network coding schemes that are independent of network parameters and maintain performance despite node dynamics.
Findings
Schemes are asymptotically rate-optimal in block-length.
Probabilistic schemes are computationally efficient.
Deterministic schemes guarantee zero-error decoding.
Abstract
Random linear network codes can be designed and implemented in a distributed manner, with low computational complexity. However, these codes are classically implemented over finite fields whose size depends on some global network parameters (size of the network, the number of sinks) that may not be known prior to code design. Also, if new nodes join the entire network code may have to be redesigned. In this work, we present the first universal and robust distributed linear network coding schemes. Our schemes are universal since they are independent of all network parameters. They are robust since if nodes join or leave, the remaining nodes do not need to change their coding operations and the receivers can still decode. They are distributed since nodes need only have topological information about the part of the network upstream of them, which can be naturally streamed as part of 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.
Taxonomy
TopicsCooperative Communication and Network Coding · Caching and Content Delivery · Advanced MIMO Systems Optimization
