The Rank Distribution of Sparse Random Linear Network Coding
نویسندگان
چکیده
منابع مشابه
Reliability of Broadcast Communications Under Sparse Random Linear Network Coding
Abstract—Ultra-reliable Point-to-Multipoint (PtM) communications are expected to become pivotal in networks offering future dependable services for smart cities. In this regard, sparse Random Linear Network Coding (RLNC) techniques have been widely employed to provide an efficient way to improve the reliability of broadcast and multicast data streams. This paper addresses the pressing concern o...
متن کاملA Content Distribution System based on Sparse Linear Network Coding
With network coding, intermediate nodes between source and destination node(s) encode the incoming packets into new ones and forward them to their outgoing links. The original content is decoded at the destination node(s). Recent theoretical results show that network coding is beneficial for peer-to-peer(P2P) content distribution. To evaluate the benefit of network coding, we implement a P2P co...
متن کاملMassive Parallelization for Random Linear Network Coding
In this paper, we propose a general-purpose graphics processing unit (GPGPU) based parallelization technique for random linear network coding (RLNC). RLNC is recognized as a useful tool for enhancing performance of networked systems, and several parallel implementation techniques have been proposed in the literature to overcome its high computation overhead. However, existing parallel methods c...
متن کاملPractical Random Linear Network Coding on GPUs
Recently, random linear network coding has been widely applied in peer-to-peer network applications. Instead of sharing the raw data with each other, peers in the network produce and send encoded data to each other. As a result, the communication protocols have been greatly simplified, and the applications experience higher end-to-end throughput and better robustness to network churns. Since it...
متن کاملOn the Rank of Random Sparse Matrices
We investigate the rank of random (symmetric) sparse matrices. Our main finding is that with high probability, any dependency that occurs in such a matrix is formed by a set of few rows that contains an overwhelming number of zeros. This allows us to obtain an exact estimate for the co-rank.
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: IEEE Access
سال: 2019
ISSN: 2169-3536
DOI: 10.1109/access.2019.2907005