Results 1 to 10 of about 546,736 (277)
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 +5 more sources
Random Linear Network Coding for 5G Mobile Video Delivery [PDF]
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 +6 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
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
Punctured Low-Bias Codes Behave Like Random Linear Codes
2022 IEEE 63rd Annual Symposium on Foundations of Computer Science (FOCS), 2022 Random linear codes are a workhorse in coding theory, and are used to show the existence of codes with the best known or even near-optimal trade-offs in many noise models. However, they have little structure besides linearity, and are not amenable to tractable error-correction algorithms.
Venkatesan Guruswami, Jonathan Mosheiff
openaire +4 more sources
Improved List-Decodability of Random Linear Binary Codes [PDF]
IEEE Transactions on Information Theory, 2021 There has been a great deal of work establishing that random linear codes are as list-decodable as uniformly random codes, in the sense that a random linear binary code of rate $1 - H(p) - ε$ is $(p,O(1/ε))$-list-decodable with high probability. In this work, we show that such codes are $(p, H(p)/ε+ 2)$-list-decodable with high probability, for any $p \
Ray Li, Mary Wootters
openaire +4 more sources
IEEE Access, 2023 Tactile Internet (TI) has very stringent networking requirements and the transport layer plays a crucial role in meeting these requirements. However, the transport layer has several inherent limitations (e.g., bufferbloat, incast issue, and head of line ...
Shahzad +3 more
doaj +1 more source
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?
Cascudo Pueyo, Ignacio +3 more
openaire +2 more sources
On linear index coding for random graphs [PDF]
2012 IEEE International Symposium on Information Theory Proceedings, 2012 A sender wishes to broadcast an n character word x in F^n (for a field F) to n receivers R_1,...,R_n. Every receiver has some side information on x consisting of a subset of the characters of x. The side information of the receivers is represented by a graph G on n vertices in which {i,j} is an edge if R_i knows x_j.
Haviv, Ishay, Langberg, Michael
openaire +2 more sources