Results 291 to 300 of about 624,831 (326)
Some of the next articles are maybe not open access.

Exploiting Parallelism With Random Linear Network Coding in High-Speed Ethernet Systems

IEEE/ACM Transactions on Networking, 2018
Parallelism has become one of the key architectural features in 40-/100-/400-Gb Ethernet multi lane distribution (MLD) standards. The MLD packetizes and distributes traffic adaptively over parallel lanes and maps them to parallel network interfaces for ...
Anna Engelmann   +3 more
semanticscholar   +1 more source

Decoding Random Linear Codes in 0.091n

2014
Decoding random linear codes is one of the central problems in coding theory and code-based cryptography. In this paper a new algorithm for decoding random long linear codes is proposed. It has a lower decoding complexity exponent than other known algorithms for the codes with rates in a range from 0 to 0.6.
Andrey Abramov, Eugeniy Krouk
openaire   +1 more source

The average equivocation of random linear binary codes in syndrome coding

2014 21st International Conference on Telecommunications (ICT), 2014
This paper studies the security performance of random codes in the syndrome coding scheme. We propose theoretical analysis using a putative (n, k) code having the same distribution of syndrome probabilities as the ensemble of all (n, k) random codes to calculate the average equivocation of random codes, and compare the theoretical results with the ...
Ke Zhang 0027   +2 more
openaire   +1 more source

Rank metric convolutional codes for Random Linear Network Coding

2012 International Symposium on Network Coding (NetCod), 2012
Random Linear Network Coding (RLNC) currently attracts a lot of attention as a technique to disseminate information in a network. In this contribution, non-coherent multi-shot RLNC is considered, that means, the unknown and time variant network is used several times.
Antonia Wachter-Zeh, Vladimir Sidorenko
openaire   +1 more source

A New Efficient Secure Coding Scheme for Random Linear Network Coding

2013 22nd International Conference on Computer Communication and Networks (ICCCN), 2013
Random Linear Network Coding (RLNC) is a promising technology of Network coding (NC) {that is} verified to be both sufficient and efficient. In this paper, we propose an efficient implementation of coding process, ensuring the security against active and passive attacks, in order to deploy RLNC in real networks, especially on battery constrained mobile
Hassan Noura 0001   +2 more
openaire   +2 more sources

The random coding bound is tight for the average linear code

2012 IEEE 27th Convention of Electrical and Electronics Engineers in Israel, 2012
In 1973, Gallager published a correspondence, consisting a proof that the random coding bound is exponentially tight for the random code ensemble at all rates, even below the expurgation rate. This result explained that the random coding upper bound does not achieve the expurgation bound due to the properties of the random ensemble, irrespective of the
Yuval Domb, Ram Zamir, Meir Feder
openaire   +1 more source

Hierarchical Performance Analysis on Random Linear Network Coding

IEEE Transactions on Communications, 2018
Random linear network coding (RLNC) is a promising network coding solution when the network topology information is not fully available to all the nodes. However, in practice, nodes have partial knowledge of the network topology information. Motivated by this, we investigate the performance of RLNC and obtain different upper bounds on the failure ...
Dan Li   +4 more
openaire   +1 more source

Massive parallelization technique for random linear network coding

2014 International Conference on Big Data and Smart Computing (BIGCOMP), 2014
Random linear network coding (RLNC) has gain popularity as a useful performance-enhancing tool for communications networks. In this paper, we propose a RLNC parallel implementation technique for General Purpose Graphical Processing Units (GPGPUs.) Recently, GPGPU technology has paved the way for parallelizing RLNC; however, current state-of-the-art ...
Seong-Min Choi, Joon-Sang Park
openaire   +1 more source

Random linear network coding for peer-to-peer applications

IEEE Network, 2010
Random linear network coding has been demonstrated to be able to improve the performance of many peer-to-peer applications, such as content distribution, multimedia streaming, distributed storage, and wireless communications. We first survey recent research progress in applying RLNC in P2P content distribution and multimedia streaming, respectively. We
Xiaowen Chu 0001, Yixin Jiang
openaire   +1 more source

Network Resources Optimization for Random Linear Network Coding

2010 IEEE International Conference on Communications, 2010
In a multisource multicast network using random linear network coding, only the lower bounds on the decoding probability, the probability that all receivers can decode all source processes, have been known. We obtained new topology-independent and topology-dependent upper bounds on the decoding probability by using a simple counting argument.
K. T. Kim, C.-S. Hwang
openaire   +1 more source

Home - About - Disclaimer - Privacy