Sparse network coding with overlapping classes
Danilo Silva,Weifei Zeng,Frank R. Kschischang +2 more
- 15 Jun 2009
- pp 74-79
TL;DR: In this article, instead of splitting packets into disjoint classes, the authors propose the use of overlapping classes, which allow the decoder to alternate between Gaussian elimination and back substitution, simultaneously boosting the performance and reducing decoding complexity.
read more
Abstract: This paper presents a novel approach to network coding for distribution of large files Instead of the usual approach of splitting packets into disjoint classes (also known as generations) we propose the use of overlapping classes The overlapping allows the decoder to alternate between Gaussian elimination and back substitution, simultaneously boosting the performance and reducing the decoding complexity Our approach can be seen as a combination of fountain coding and network coding Simulation results are presented that demonstrate the promise of our approach
read more
Chat with Paper
AI Agents for this Paper
Find similar papers on Google Scholar, PubMed and Arxiv
Write a critical review of this paper
Analyze citations of this paper to find unaddressed research gaps
Citations
Batched Sparse Codes
Shenghao Yang,Raymond W. Yeung +1 more
TL;DR: This paper introduces batched sparse code (BATS code), which enables a digital fountain approach to resolve the above issue of high computational and storage costs in the network devices and terminals.
156
Batched Sparse Codes
Shenghao Yang,Raymond W. Yeung +1 more
TL;DR: In this article, the authors proposed the BATched Sparse code (BATS code), which is a coding scheme that consists of an outer code and an inner code, which works with the inner code that comprises random linear coding at the intermediate network nodes.
122
Sparse network coding with overlapping classes
Danilo Silva,Weifei Zeng,Frank R. Kschischang +2 more
- 15 Jun 2009
TL;DR: In this article, instead of splitting packets into disjoint classes, the authors propose the use of overlapping classes, which allow the decoder to alternate between Gaussian elimination and back substitution, simultaneously boosting the performance and reducing decoding complexity.
Coding for a network coded fountain
Shenghao Yang,Raymond W. Yeung +1 more
- 03 Oct 2011
TL;DR: It is verified theoretically for certain cases and demonstrated numerically for the general cases that BATS codes achieve rates very close to the capacity of linear operator channels.
Effects of the Generation Size and Overlap on Throughput and Complexity in Randomized Linear Network Coding
TL;DR: In this paper, the authors model coding over generations with random generation scheduling as a coupon collector's brotherhood problem and derive the expected number of coded packets needed for successful decoding of the entire content as well as the probability of decoding failure.
91
References
Network information flow
TL;DR: This work reveals that it is in general not optimal to regard the information to be multicast as a "fluid" which can simply be routed or replicated, and by employing coding at the nodes, which the work refers to as network coding, bandwidth can in general be saved.
9.3K
Linear network coding
TL;DR: This work forms this multicast problem and proves that linear coding suffices to achieve the optimum, which is the max-flow from the source to each receiving node.
A Random Linear Network Coding Approach to Multicast
TL;DR: This work presents a distributed random linear network coding approach for transmission and compression of information in general multisource multicast networks, and shows that this approach can take advantage of redundant network capacity for improved success probability and robustness.
An algebraic approach to network coding
Ralf Koetter,Muriel Medard +1 more
TL;DR: For the multicast setup it is proved that there exist coding strategies that provide maximally robust networks and that do not require adaptation of the network interior to the failure pattern in question.
XORs in the air: practical wireless network coding
TL;DR: The results show that using COPE at the forwarding layer, without modifying routing and higher layers, increases network throughput, and the gains vary from a few percent to several folds depending on the traffic pattern, congestion level, and transport protocol.