A new construction method for networks from matroids

Authors:
Salim El Rouayheb;Alex Sprintson;Costas Georghiades
Affiliations:
Department of Electrical and Computer Engineering, Texas A&M University, College Station, TX;Department of Electrical and Computer Engineering, Texas A&M University, College Station, TX;Department of Electrical and Computer Engineering, Texas A&M University, College Station, TX
Venue:
ISIT'09 Proceedings of the 2009 IEEE international conference on Symposium on Information Theory - Volume 4
Year:
2009

Citing 12
Cited 1

Abstract functional dependency structures

Theoretical Computer Science
Almost Affine Codes

Designs, Codes and Cryptography
An algebraic approach to network coding

IEEE/ACM Transactions on Networking (TON)
Index Coding with Side Information

FOCS '06 Proceedings of the 47th Annual IEEE Symposium on Foundations of Computer Science
Network Coding Theory (Foundations and Trends(R) in Communications and Information Theory)

Network Coding Theory (Foundations and Trends(R) in Communications and Information Theory)
Non-Linear Index Coding Outperforming the Linear Optimum

FOCS '07 Proceedings of the 48th Annual IEEE Symposium on Foundations of Computer Science
Network Coding Fundamentals

Network Coding Fundamentals
Network information flow

IEEE Transactions on Information Theory
Linear network coding

IEEE Transactions on Information Theory
Polynomial time algorithms for multicast network code construction

IEEE Transactions on Information Theory
Insufficiency of linear coding in network information flow

IEEE Transactions on Information Theory
Networks, Matroids, and Non-Shannon Information Inequalities

IEEE Transactions on Information Theory

An approach for network information flow analysis for systems of embedded components

MMM-ACNS'12 Proceedings of the 6th international conference on Mathematical Methods, Models and Architectures for Computer Network Security: computer network security

Quantified Score

Hi-index	0.00

Visualization

Abstract

We study the problem of information flow in communication networks with noiseless links in which the dependency relations among the data flowing on the different network edges satisfy matroidal constraints. We present a construction that maps any given matroid to a network that admits vector linear network codes over a certain field if and only if the matroid has a multilinear representation over the same field. This new construction strengthens previous results in the literature and, thus, establishes a deeper connection between network coding and matroid theory. We also explore another, more general, mathematical construct referred to as FD-relation which is more suitable than matroids in capturing the dependency relations in general networks.