Add to ORKGInternational audienceThis paper proposes LTNC, a new recoding algorithm to build low complexity network codes. At the core of LTNC is a decentralized version of LT codes that allows the use of fast belief propagation decoding instead of high complexity Gauss reduction used by random linear network coding (RLNC). In the context of a peer-to-peer content dissemination application, we observe that LTNC trades advantageously communication optimality of RLNC with decoding cost as it incurs only 38.5% of bandwidth overhead for a gain of almost 99% in CPU cycles
In this paper, a new network coding model is proposed to unify instantly decodable network coding (I...
Many modern communication networks suffer significantly from the unreliable characteristic of their ...
Because of the mobility, computing power and changeable topology of dynamic networks, it is difficul...
International audienceThis paper proposes LTNC, a new recoding algorithm to build low complexity net...
International audienceNetwork coding has been successfully applied in large-scale content disseminat...
Abstract—Network coding has been successfully applied in large-scale content dissemination systems. ...
Random Linear Network Coding (RLNC) is a new coding technique which can provide higher reliability a...
National audienceThis article deals with the decoding of short block length Low Density Parity Check...
Our primary goal in this paper is to traverse the performance gap between two linear network coding ...
Two main approaches to achieve reliable data transfer over error-prone networks are retransmission a...
Future networks are expected to depart from traditional routing schemes in order to embrace network ...
We consider the problem of efficient decoding of a random linear code over a finite field. In partic...
In this paper we consider the per-node run-time complexity of network multicast codes. We show that ...
International audienceIn this paper, we investigate the benefits of applying a form of network codin...
Random Linear Network Coding (RLNC) has emerged as a powerful tool for robust high-throughput multic...
In this paper, a new network coding model is proposed to unify instantly decodable network coding (I...
Many modern communication networks suffer significantly from the unreliable characteristic of their ...
Because of the mobility, computing power and changeable topology of dynamic networks, it is difficul...
International audienceThis paper proposes LTNC, a new recoding algorithm to build low complexity net...
International audienceNetwork coding has been successfully applied in large-scale content disseminat...
Abstract—Network coding has been successfully applied in large-scale content dissemination systems. ...
Random Linear Network Coding (RLNC) is a new coding technique which can provide higher reliability a...
National audienceThis article deals with the decoding of short block length Low Density Parity Check...
Our primary goal in this paper is to traverse the performance gap between two linear network coding ...
Two main approaches to achieve reliable data transfer over error-prone networks are retransmission a...
Future networks are expected to depart from traditional routing schemes in order to embrace network ...
We consider the problem of efficient decoding of a random linear code over a finite field. In partic...
In this paper we consider the per-node run-time complexity of network multicast codes. We show that ...
International audienceIn this paper, we investigate the benefits of applying a form of network codin...
Random Linear Network Coding (RLNC) has emerged as a powerful tool for robust high-throughput multic...
In this paper, a new network coding model is proposed to unify instantly decodable network coding (I...
Many modern communication networks suffer significantly from the unreliable characteristic of their ...
Because of the mobility, computing power and changeable topology of dynamic networks, it is difficul...