pith. sign in

arxiv: 1001.2077 · v2 · submitted 2010-01-13 · 💻 cs.IT · math.IT

On Random Linear Network Coding for Butterfly Network

classification 💻 cs.IT math.IT
keywords networkcodingbutterflylinearrandomfailureperformanceprobabilities
0
0 comments X
read the original abstract

Random linear network coding is a feasible encoding tool for network coding, specially for the non-coherent network, and its performance is important in theory and application. In this letter, we study the performance of random linear network coding for the well-known butterfly network by analyzing the failure probabilities. We determine the failure probabilities of random linear network coding for the well-known butterfly network and the butterfly network with channel failure probability p.

This paper has not been read by Pith yet.

discussion (0)

Sign in with ORCID, Apple, or X to comment. Anyone can read and Pith papers without signing in.