Results 11 to 20 of about 329,540 (279)
Minimal Header Overhead for Random Linear Network Coding [PDF]
2015 IEEE International Conference on Communication Workshop (ICCW), 2015 The energy used to transmit a single bit of data between the devices in wireless networks is equal to the energy for performing hundreds of instructions in those devices.
Gligoroski, Danilo +2 more
core +2 more sources
Rethinking the Intercept Probability of Random Linear Network Coding [PDF]
IEEE Communications Letters, 2015 This letter considers a network comprising a transmitter, which employs random linear network coding to encode a message, a legitimate receiver, which can recover the message if it gathers a sufficient number of linearly independent coded packets, and an
Chatzigeorgiou, Ioannis +2 more
core +7 more sources
Random Linear Network Coding For Time Division Duplexing: Energy Analysis [PDF]
2009 IEEE International Conference on Communications, 2009 We study the energy performance of random linear network coding for time division duplexing channels. We assume a packet erasure channel with nodes that cannot transmit and receive information simultaneously.
Lucani, Daniel E. +2 more
core +5 more sources
From Instantly Decodable to Random Linear Network Coding [PDF]
, 2013 Our primary goal in this paper is to traverse the performance gap between two linear network coding schemes: random linear network coding (RLNC) and instantly decodable network coding (IDNC) in terms of throughput and decoding delay.
Aboutorab, Neda +2 more
core +3 more sources
Reliability of Relay Networks Under Random Linear Network Coding [PDF]
IEEE Transactions on Communications, 2019 We consider a single-source, multiple-relay, single-destination lossy network employing Random Linear Network coding at all transmitting nodes. We address the problem of calculating the probability of successful decoding at the destination node. In contrast with some previous studies, we assume the classical RLNC scheme, in which the relaying nodes ...
Evgeny Tsimbalo, Magnus Sandell
openaire +2 more sources
Reliability of Multicast Under Random Linear Network Coding [PDF]
IEEE Transactions on Communications, 2018 To appear on IEEE Transactions on ...
Evgeny Tsimbalo +2 more
openaire +4 more sources
Exact Decoding Probability Under Random Linear Network Coding [PDF]
IEEE Communications Letters, 2011 In this letter, we compute the exact probability that a receiver obtains N linearly independent packets among K ≥ N received packets, when the sender/s use/s random linear network coding over a Galois Field of size q. Such condition maps to the receiver's capability to decode the original information, and its mathematical characterization helps to ...
Trullols Cruces, Óscar +2 more
openaire +4 more sources
Random Linear Network Coding: A free cipher? [PDF]
2007 IEEE International Symposium on Information Theory, 2007 5 pages, 2 figures, Accepted for the IEEE International Symposium on Information Theory, Nice, France, June ...
Lima, Lu��sa +2 more
openaire +3 more sources
On Field Size and Success Probability in Network Coding [PDF]
, 2008 Using tools from algebraic geometry and Groebner basis theory we solve two problems in network coding. First we present a method to determine the smallest field size for which linear network coding is feasible.
Geil, Olav +2 more
core +2 more sources
FSW: Fulcrum Sliding Window Coding for Low-Latency Communication
IEEE Access, 2022 Fulcrum Random Linear Network Coding (RLNC) combines outer coding in a large Galois Field, e.g., $GF(2^{8})$ , with inner coding in $GF(2)$ to flexibly trade off the strong protection (low probability of linear dependent coding coefficients) of $GF(2^
Elif Tasdemir +4 more
doaj +1 more source