Results 261 to 270 of about 523,662 (284)

Prioritized Wireless Transmissions Using Random Linear Codes

2010 IEEE International Symposium on Network Coding (NetCod), 2010
We investigate approximation algorithms for the problem of prioritized broadcast transmissions over independent erasure channels first described in Tran et al., 2009. In this work, the authors showed that under some settings, the achievable throughput regions for prioritized broadcast transmissions can be computed by a polynomial-time algorithm.
Tuan Tran, Thinh Nguyen
openaire   +1 more source

Random frames from binary linear block codes

2010 44th Annual Conference on Information Sciences and Systems (CISS), 2010
Let C be an [n, k, d] binary linear block code of length n, dimension k and minimum Hamming distance d over GF(2n). Let d⊥ denote the minimum Hamming distance of the dual code of C over GF(2n). Let ɛ : GF(2n) → {−1, 1}n be the component-wise mapping ɛ(v i ) := (−1)vi , for v =(v 1 , v 2 , … , v n ) ∈ GF(2n).
Behtash Babadi, Vahid Tarokh
openaire   +1 more source

Random and burst error correcting linear codes

Journal of Information and Optimization Sciences, 1996
Abstract This paper presents various lower and upper bounds on the number of parity check digits required for linear codes having sub-block structure that detect and correct random or/and burst errors.
B. K. Dass, E. Foundas, P. Tsikouras
openaire   +1 more source

Random linear packet coding for broadcast networks

2014 Oceans - St. John's, 2014
Random linear packet coding is considered for efficient broadcasting in networks with large propagation delays, such as underwater acoustic networks. To additionally overcome the effects of fading, we combine packet coding with adaptive power control, whereby the transmitter adjusts its power upon receiving feedback from the receiver on the current ...
R. Ahmed, M. Stojanovic, M. Chitre
openaire   +1 more source

Subspace Authentication for Random Linear Network Coding

2016
As is introduced in Chap. 2, network coding is notoriously susceptible to pollution attacks: a single polluted packet can end up corrupting bunches of good ones.
Peng Zhang, Chuang Lin
openaire   +1 more source

Lightweight Encryption for Random Linear Network Coding

2016
Researchers have shown that network coding can help reduce the energy consumption of communication by reducing transmissions.
Peng Zhang, Chuang Lin
openaire   +1 more source

Bounds for List-Decoding and List-Recovery of Random Linear Codes

IEEE Transactions on Information Theory, 2022
Venkatesan Guruswami, Ray Li, Jonathan Mosheiff   +2 more
exaly  

Latency performance of encoding with random linear network coding

2018
In this paper, we present a performance study of the impact of generation and symbol sizes on latency for encoding with Random Linear Network Coding (RLNC). This analysis is important for low latency applications of RLNC as well as data storage applications that use large blocks of data, where the encoding process can be parallelized based on system ...
Nielsen, Lars, Hansen, René Rydhof, Lucani Rötter, Daniel Enrique   +2 more
openaire   +2 more sources

XOR-Embedded Random Linear Network Coding

The Journal of Korean Institute of Communications and Information Sciences
Patrick Enenchew, Dongho You
openaire   +1 more source

Distance Spectrum of Fixed-Rate Raptor Codes With Linear Random Precoders

IEEE Journal on Selected Areas in Communications, 2016
Francisco Lazaro, Enrico Paolini, Gianluigi Liva   +2 more
exaly