Universal and Robust Distributed Network Codes

Random linear network codes can be designed and implemented in a distributed manner, with low computational complexity. However, these codes are classically implemented [1] 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 communication protocol. We present both probabilistic and deterministic schemes that are all asympt...

• Type: Journal
• Year: 2010
• Where: CORR
• Authors: Tracey Ho, Sidharth Jaggi, Svitlana Vyetrenko, Lingxiao Xia
• Keywords: CORR 2010, Education, Linear Network, Network Codes, Network Parameters