Results 291 to 300 of about 1,110,597 (333)
Some of the next articles are maybe not open access.

Variable-Rate Linear Network Coding

2006 IEEE Information Theory Workshop, 2006
Ahlswede et al., (2000) established that if coding is applied to nodes in a network, rather than routing alone, the network capacity can be improved. Li et al., (2003) proved that linear network coding is sufficient to achieve the maximum capacity in a single-source finite acyclic network. In this paper, we study variable-rate linear network coding and
Silas L. Fong, Raymond W. Yeung
openaire   +1 more source

Strongly Secure Linear Network Coding

IEICE Transactions on Fundamentals of Electronics, Communications and Computer Sciences, 2008
In a network with capacity h for multicast, information Xh = (X1, X2, ₀, Xh) can be transmitted from a source node to sink nodes without error by a linear network code. Furthermore, secret information Sr = (S1, S2, ₀, Sr) can be transmitted securely against wiretappers by k-secure network coding for k ≤ h-r.
K. HARADA, H. YAMAMOTO
openaire   +1 more source

Buffer-Aided Physical-Layer Network Coding With Optimal Linear Code Designs for Cooperative Networks

IEEE Transactions on Communications, 2018
In this paper, we propose buffer-aided physical-layer network coding (PLNC) techniques for improving data transmission over cooperative networks. In particular, we develop buffer-aided PLNC schemes and relay pair selection algorithms for direct-sequence ...
Jiaqi Gu, R. D. de Lamare, M. Huemer
semanticscholar   +1 more source

On network matroids and linear network codes

2008 IEEE International Symposium on Information Theory, 2008
This paper deals with matroids on the edge set of a network. Through the structure of edge-disjoint paths, a single-source network is associated with a network matroid, which turns out to be representable. A linear network code on an acyclic network assigns a coding vector to every edge.
null Qifu Sun   +2 more
openaire   +1 more source

Constructing multicast networks where vector linear coding outperforms scalar linear coding

2015 IEEE International Symposium on Information Theory (ISIT), 2015
Vector linear network coding (LNC) is a generalization of the conventional scalar LNC, such that the data unit transmitted on every edge is an L-dimensional vector of data symbols over a base field GF(q). There are classical exemplifying multi-source networks that have simple vector linear solutions but no scalar linear solutions over any field.
Qifu Sun   +3 more
openaire   +1 more source

Homomorphic error-control codes for linear network coding in packet networks

China Communications, 2017
In this work, the homomorphism of the classic linear block code in linear network coding for the case of binary field and its extensions is studied. It is proved that the classic linear error-control block code is homomorphic network error-control code in network coding.
Xiaodong Han, Fei Gao
openaire   +1 more source

Linear Network Error Correction Coding Revisited

2020 IEEE International Symposium on Information Theory (ISIT), 2020
We consider linear network error correction (LNEC) coding when errors may occur on the edges of a communication network of which the topology is known. In this paper, we first revisit and explore the framework of LNEC coding, and then unify two well-known LNEC coding approaches.
Xuan Guang, Raymond W. Yeung
openaire   +1 more source

Boolean Networks: Coding, Linearizing and Dynamics

2010 International Workshop on Chaos-Fractal Theories and Applications, 2010
In this paper, an effective scheme is proposed for coding $n$-node Boolean networks. The scheme can uniquely designate a distinguished integer in the range from $0$ to $(2^{n\times2^n}-1)$ for any a given Boolean network. At the same time, a linearized matrix is obtained for any a given Boolean network.
Qinbin He, Fangyue Chen, Zengrong Liu
openaire   +1 more source

Self-adapting Linear Network Coding Emulation

2019 International Symposium on Networks, Computers and Communications (ISNCC), 2019
Linear network coding (LNC) introduced a new paradigm for routing data across networks where the transported packets are not the original information packets but rather linear combinations of the original packets. This is known to allow a more efficient use of the network resources.
Nuno B. Coelho   +2 more
openaire   +1 more source

Linear codes for network information flow

1999 Information Theory and Networking Workshop (Cat. No.99EX371), 2003
Network information flow was recently introduced by Ahlswede et al. They studied the single-source problem. Their work revealed that it is in general not optimal to consider the information to be multicast in a network as a "fluid" which can simply be routed or replicated. Rather, by employing coding at the nodes, bandwidth can in general be saved.
S.-Y.R. Li, R.W. Yeung
openaire   +1 more source

Home - About - Disclaimer - Privacy