Results 1 to 10 of about 139,863 (253)
Investigating Random Linear Coding from a Pricing Perspective [PDF]
Entropy, 2018 In this paper, we study the implications of using a form of network coding known as Random Linear Coding (RLC) for unicast communications from an economic perspective by investigating a simple scenario, in which several network nodes, the users, download
Hailing Zhu, Khmaies Ouahada
doaj +2 more sources
On GRAND-Assisted Vector Random Linear Network Coding in Wireless Broadcasts [PDF]
EntropyRecent works have combined random linear network coding (RLNC) with guessing random additive noise decoding (GRAND) to leverage RLNC packets to partially correct bit errors prior to RLNC decoding, so as to reduce the packet erasure rates in wireless ...
Rina Su +3 more
doaj +2 more sources
Random linear codes in steganography [PDF]
Biuletyn Wojskowej Akademii Technicznej, 2016 Syndrome coding using linear codes is a technique that allows improvement in the steganographic algorithms parameters. The use of random linear codes gives a great flexibility in choosing the parameters of the linear code.
Kamil Kaczyński
doaj +2 more sources
A Random Linear Network Coding Approach to Multicast [PDF]
IEEE Transactions on Information Theory, 2006 We present a distributed random linear network coding approach for transmission and compression of information in general multisource multicast networks. Network nodes independently and randomly select linear mappings from inputs onto output links over some field. We show that this achieves capacity with probability exponentially approaching 1 with the
R Koetter, T Ho
exaly +3 more sources
The Rank Distribution of Sparse Random Linear Network Coding
IEEE Access, 2019 Sparse random linear network coding (SRLNC) is a promising solution for reducing the complexity of random linear network coding (RLNC). RLNC can be modeled as a linear operator channel (LOC).
Wenlin Chen, Fang Lu, Yan Dong
doaj +3 more sources
The Random Coding Bound Is Tight for the Average Linear Code or Lattice [PDF]
IEEE Transactions on Information Theory, 2016 In 1973, Gallager proved that the random-coding bound is exponentially tight for the random code ensemble at all rates, even below expurgation. This result explained that the random-coding exponent does not achieve the expurgation exponent due to the properties of the random ensemble, irrespective of the utilized bounding technique.
Meir Feder, Ram Zamir
exaly +3 more sources
Random Linear Network Coding for 5G Mobile Video Delivery
Information, 2018 An exponential increase in mobile video delivery will continue with the demand for higher resolution, multi-view and large-scale multicast video services.
Dejan Vukobratovic +3 more
doaj +3 more sources
Reliability of Multicast Under Random Linear Network Coding [PDF]
IEEE Transactions on Communications, 2018 To appear on IEEE Transactions on ...
Robert Piechocki +2 more
exaly +5 more sources
Rethinking the Intercept Probability of Random Linear Network Coding [PDF]
IEEE Communications Letters, 2015 IEEE Communications Letters, to ...
Ioannis Chatzigeorgiou +2 more
exaly +5 more sources
Squares of Random Linear Codes [PDF]
IEEE Transactions on Information Theory, 2015 Given a linear code $C$, one can define the $d$-th power of $C$ as the span of all componentwise products of $d$ elements of $C$. A power of $C$ may quickly fill the whole space. Our purpose is to answer the following question: does the square of a code "typically" fill the whole space?
I. Cascudo (Ignacio) +3 more
openaire +2 more sources