Networks, Matroids, and Non-Shannon Information Inequalities
Reads0
Chats0
TLDR
The Vamos network is constructed, and it is proved that Shannon-type information inequalities are insufficient even for computing network coding capacities of multiple-unicast networks.Abstract:
We define a class of networks, called matroidal networks, which includes as special cases all scalar-linearly solvable networks, and in particular solvable multicast networks. We then present a method for constructing matroidal networks from known matroids. We specifically construct networks that play an important role in proving results in the literature, such as the insufficiency of linear network coding and the unachievability of network coding capacity. We also construct a new network, from the Vamos matroid, which we call the Vamos network, and use it to prove that Shannon-type information inequalities are in general not sufficient for computing network coding capacities. To accomplish this, we obtain a capacity upper bound for the Vamos network using a non-Shannon-type information inequality discovered in 1998 by Zhang and Yeung, and then show that it is smaller than any such bound derived from Shannon-type information inequalities. This is the first application of a non-Shannon-type inequality to network coding. We also compute the exact routing capacity and linear coding capacity of the Vamos network. Finally, using a variation of the Vamos network, we prove that Shannon-type information inequalities are insufficient even for computing network coding capacities of multiple-unicast networks.read more
Citations
More filters
Book
Network Coding Theory
TL;DR: This chapter discusses network Coding and Algebraic Coding, which focuses on Acyclic Networks, and the Fundamental Limits of Linear Codes, which addresses these issues in more detail.
Book
Network Coding: An Introduction
Tracey Ho,Desmond S. Lun +1 more
TL;DR: The first book to present a unified and intuitive overview of the theory, applications, challenges, and future directions of this emerging field, this is a must-have resource for those working in wireline or wireless networking.
Journal ArticleDOI
On the Index Coding Problem and Its Relation to Network Coding and Matroid Theory
TL;DR: It is shown that vectorlinear codes outperform scalar linear index codes and that vector linear codes are insufficient for achieving the optimum number of transmissions.
Posted Content
On the Index Coding Problem and its Relation to Network Coding and Matroid Theory
TL;DR: In this article, the authors analyzed the relation between the index coding problem, the more general network coding problem and the problem of finding a linear representation of a matroid and showed that any instance of the network coding and matroid representation problems can be efficiently reduced to an instance of index coding.
Journal ArticleDOI
The Holographic Entropy Cone
TL;DR: In this paper, a systematic enumeration and classification of entropy inequalities satisfied by the Ryu-Takayanagi formula for conformal field theory states with smooth holographic dual geometries was initiated.
References
More filters
Journal ArticleDOI
A mathematical theory of communication
TL;DR: This final installment of the paper considers the case where the signals or the messages or both are continuously variable, in contrast with the discrete nature assumed until now.
Journal ArticleDOI
Network information flow
TL;DR: This work reveals that it is in general not optimal to regard the information to be multicast as a "fluid" which can simply be routed or replicated, and by employing coding at the nodes, which the work refers to as network coding, bandwidth can in general be saved.
Book
Flows in networks
D. R. Ford,D. R. Fulkerson +1 more
TL;DR: Ford and Fulkerson as mentioned in this paper set the foundation for the study of network flow problems and developed powerful computational tools for solving and analyzing network flow models, and also furthered the understanding of linear programming.
Journal ArticleDOI
Linear network coding
TL;DR: This work forms this multicast problem and proves that linear coding suffices to achieve the optimum, which is the max-flow from the source to each receiving node.
Journal ArticleDOI
Flows in Networks.
TL;DR: The techniques presented by Ford and Fulkerson spurred the development of powerful computational tools for solving and analyzing network flow models, and also furthered the understanding of linear programming.