Valuable messages and random outputs of channels in linear network coding

Authors:
Ning Cai
Affiliations:
The State Key Laboratory of Integrated Services Networks, Xidian University, Xi'an, China
Venue:
ISIT'09 Proceedings of the 2009 IEEE international conference on Symposium on Information Theory - Volume 1
Year:
2009

Citing 3
Cited 2

Strongly Secure Linear Network Coding

IEICE Transactions on Fundamentals of Electronics, Communications and Computer Sciences
Linear network coding

IEEE Transactions on Information Theory
A Random Linear Network Coding Approach to Multicast

IEEE Transactions on Information Theory

Linear-code multicast on parallel architectures

Advances in Engineering Software
Energy efficient network coding-based MAC for cooperative ARQ wireless networks

Ad Hoc Networks

Quantified Score

Hi-index	0.00

Visualization

Abstract

Motivated by the fact that the most problems on network coding can be represented as how much information about a given subset of network inputs can be obtained by legal or illegal users from the channels accessed by them, in this paper we investigate the relation between a subset of random network inputs and the outputs of an arbitrarily given set of channels in networks. We focus on linear network codes because they are widely studied and applied. We begin with the algebraic structure of cosets of linear subspaces and derive bounds on their mutual information and the conditions for their tightness. To apply the results to random linear network coding we introduce strongly generic linear network codes such that for sufficiently large coding fields a random linear network code is strongly generic with high probability. Our results show that random linear network coding is good for error correction and security but not efficient for multiple source network coding.