Corpus ID: 21695172

Optimal Finite Length Coding Rate of Random Linear Network Coding Schemes

@article{DoDuy2018OptimalFL,
  title={Optimal Finite Length Coding Rate of Random Linear Network Coding Schemes},
  author={Tan Do-Duy and M. V{\'a}zquez-Castro},
  journal={ArXiv},
  year={2018},
  volume={abs/1805.05783}
}
In this paper, we propose a methodology to compute the optimal finite-length coding rate for random linear network coding schemes over a line network. To do so, we first model the encoding, reencoding, and decoding process of different coding schemes in matrix notation and corresponding error probabilities. Specifically, we model the finite-length performance for random linear capacity-achieving schemes: non-systematic (RLNC) and systematic (SNC) and non-capacity achieving schemes: SNC with… Expand

References

SHOWING 1-10 OF 15 REFERENCES
Round-robin streaming with generations
TLDR
It is shown that coding at the application layer brings about a significant increase in net data throughput, and thereby reduction in energy consumption due to reduced communication time, and on devices with constrained computing resources, heavy coding operations cause packet drops in higher layers and negatively affect the net throughput. Expand
Systematic wireless network coding
TLDR
It is argued that if this systematic network coding strategy is used only at certain nodes in the network, the throughput will not be reduced relative to random linear network coding, and if packets can traverse the entire network in their systematic (uncoded) form, per-packet delay can be reduced, decoding complexity can be reduction, and the potential to recover packets from incomplete coded blocks will be improved. Expand
Link Layer Systematic Random Network Coding for DVB-S2X/RCS
TLDR
The simulation results show that LL-SNC achieves significantly higher transmission rates and reliability than state-of-the-art link layer forward erasure correction (LL-FEC) schemes, and results confirm the benefits of LL- SNC for different frame lengths available in the standard. Expand
Effects of the Generation Size and Overlap on Throughput and Complexity in Randomized Linear Network Coding
TLDR
This work model coding over generations with random generation scheduling as a coupon collector's brotherhood problem to derive the expected number of coded packets needed for successful decoding of the entire content as well as the probability of decoding failure and quantify the tradeoff between computational complexity and throughput. Expand
Whether and Where to Code in the Wireless Packet Erasure Relay Channel
TLDR
This paper explores the strategic use of network coding in the wireless packet erasure relay channel and shows that coding at the relay alone while operating in a rateless fashion is neither throughput nor energy efficient. Expand
Caterpillar RLNC (CRLNC): A Practical Finite Sliding Window RLNC Approach
TLDR
CRLNC is introduced, a practical finite sliding window RLNC approach that requires only simple modifications of the encoded packet structure and elementary pre-processing steps of the received coded packets before feeding the received coding coefficients and symbols into a standard block-based RLNC decoder. Expand
Coding schemes for line networks
TLDR
This work considers a simple network, where a source and destination node are connected with a line of erasure channels, and proposes coding schemes for this setting in terms of complexity, delay, achievable rate, memory requirement, and adaptability to unknown channel parameters. Expand
Efficient communication over cellular networks with network coding in emergency scenarios
  • Tan Do-Duy, M. Vázquez-Castro
  • Computer Science
  • 2015 2nd International Conference on Information and Communication Technologies for Disaster Management (ICT-DM)
  • 2015
TLDR
This work proposes a network architecture that uses cellular networks and WiFi connections to deliver large files in emergency scenarios under the impairments of wireless channel such as packet losses and intermittent connection. Expand
A Complete Proof of Universal Inequalities for the Distribution Function of the Binomial Law
We present a new form and a short complete proof of explicit two-sided estimates for the distribution function $F_{n,p}(k)$ of the binomial law with parameters $n,p$ from [D. Alfers and H. Dinges, Z.Expand
Wireless reliability: Rethinking 802.11 packet loss
TLDR
This work conducted extensive experiments on the individual loss characteristics of five common wireless cards, showing that while the cards behave similarly on the macro-level, the cards perform quite differently on the micro-level (e.g. burstiness, correlation, and consistency). Expand
...
1
2
...