Results 31 to 40 of about 329,540 (279)
Linear-Complexity Overhead-Optimized Random Linear Network Codes
, 2013 Sparse random linear network coding (SRLNC) is an attractive technique proposed in the literature to reduce the decoding complexity of random linear network coding. Recognizing the fact that the existing SRLNC schemes are not efficient in terms of the required reception overhead, we consider the problem of designing overhead-optimized SRLNC schemes. To
Mahdaviani, Kaveh +2 more
openaire +2 more sources
Sparse Random Linear Network Coding For Low Latency Allcast [PDF]
2019 57th Annual Allerton Conference on Communication, Control, and Computing (Allerton), 2019 Numerous applications require the sharing of data from each node on a network with every other node. In the case of Connected and Autonomous Vehicles (CAVs), it will be necessary for vehicles to update each other with their positions, manoeuvring intentions, and other telemetry data, despite shadowing caused by other vehicles.
Graham, Mark A +2 more
openaire +2 more sources
Passive network tomography for erroneous networks: A network coding approach
, 2010 Passive network tomography uses end-to-end observations of network communication to characterize the network, for instance to estimate the network topology and to localize random or adversarial glitches.
Chen, Minghua +2 more
core +2 more sources
On Intercept Probability Minimization under Sparse Random Linear Network Coding [PDF]
, 2019 This paper considers a network where a node wishes to transmit a source message to a legitimate receiver in the presence of an eavesdropper. The transmitter secures its transmissions employing a sparse implementation of Random Linear Network Coding (RLNC)
Nix, Andrew +2 more
core +3 more sources
Lightweight Random Linear Coding over Wireless Mesh Networks
, 2015 We propose an enhanced version of an intra-flow Network Coding protocol, which was conceived to offer a reliable communication service, by means of the combination a Random Linear Coding (RLC) scheme with the UDP protocol. We reduce the overhead that was originally required in the protocol header and we assess, through an extensive campaign carried out
Garrido Torres, Pablo +4 more
openaire +2 more sources
Decoding Algorithms for Random Linear Network Codes [PDF]
, 2011 We consider the problem of efficient decoding of a random linear code over a finite field. In particular we are interested in the case where the code is random, relatively sparse, and use the binary finite field as an example. The goal is to decode the data using fewer operations to potentially achieve a high coding throughput, and reduce energy ...
Heide, Janus +2 more
openaire +3 more sources
ComboCoding: Combined intra-/inter-flow network coding for TCP over disruptive MANETs
Journal of Advanced Research, 2011 TCP over wireless networks is challenging due to random losses and ACK interference. Although network coding schemes have been proposed to improve TCP robustness against extreme random losses, a critical problem still remains of DATA–ACK interference. To
Chien-Chia Chen +5 more
doaj +1 more source
On conjugacy classes of subgroups of the general linear group and cyclic orbit codes [PDF]
, 2011 Orbit codes are a family of codes employable for communications on a random linear network coding channel. The paper focuses on the classification of these codes.
Manganiello, Felice +2 more
core +1 more source
MATIN: a random network coding based framework for high quality peer-to-peer live video streaming. [PDF]
PLoS ONE, 2013 In recent years, Random Network Coding (RNC) has emerged as a promising solution for efficient Peer-to-Peer (P2P) video multicasting over the Internet. This probably refers to this fact that RNC noticeably increases the error resiliency and throughput of
Behrang Barekatain +7 more
doaj +1 more source
SpaRec: Sparse Systematic RLNC Recoding in Multi-Hop Networks
IEEE Access, 2021 Sparse Random Linear Network Coding (RLNC) reduces the computational complexity of the RLNC decoding through a low density of the non-zero coding coefficients, which can be achieved through sending uncoded (systematic) packets.
Elif Tasdemir +6 more
doaj +1 more source