Network Coding and 2 Matroid Theory 3 This paper explores the connection between network coding and Matroid theory
نویسندگان
چکیده
2 Matroid Theory 3 This paper explores the connection between network coding and Matroid theory, 4 a branch of mathematics that generalizes linear algebra and graph theory. ABSTRACT | Networks derived from matroids have played a 7 fundamental role in proving theoretical results about the limits 8 of network coding. In this tutorial paper, we review many con-9 nections between matroids and network coding theory, with 10 specific emphasis on network solvability, admissible network 11 alphabet sizes, linear coding, and network capacity.
منابع مشابه
Network Coding and 2 Matroid Theory 3 This paper explores the connection between network coding and matroid theory , 4 a branch of mathematics that generalizes
2 Matroid Theory 3 This paper explores the connection between network coding and matroid theory, 4 a branch of mathematics that generalizes linear algebra and graph theory. ABSTRACT | Networks derived from matroids have played a 7 fundamental role in proving theoretical results about the limits 8 of network coding. In this tutorial paper, we review many con-9 nections between matroids and netwo...
متن کاملThis paper explores the connection between network coding and matroid theory , a branch of mathematics that generalizes linear algebra and graph theory
| Networks derived from matroids have played a fundamental role in proving theoretical results about the limits of network coding. In this tutorial paper, we review many connections between matroids and network coding theory, with specific emphasis on network solvability, admissible network alphabet sizes, linear coding, and network capacity.
متن کاملMatroids, generalized networks, and electric network synthesis
Matroid theory has been applied to solve problems in generalized assignment, operations research, control theory, network theory, flow theory, generalized flow theory or linear programming, coding theory, and telecommunication network design. The operations of matroid union, matroid partitioning, matroid intersection, and the theorem on the greedy algorithm, Rado’s theorem, and Brualdi’s symmet...
متن کاملApplications of Matroid Theory and Combinatorial Optimization to Information and Coding Theory
The aim of this workshop was to bring together experts and students from pure and applied mathematics, computer science, and engineering, who are working on related problems in the areas of matroid theory, combinatorial optimization, coding theory, secret sharing, network coding, and information inequalities. The goal was to foster exchange of mathematical ideas and tools that can help tackle s...
متن کاملScalar Solvability of Network Computation Problems and Representable Matroids
We consider the following network computation problem. In an acyclic network, there are multiple source nodes, each generating multiple messages, and there are multiple sink nodes, each demanding a function of the source messages. The network coding problem corresponds to the case in which every demand function is equal to some source message, i.e., each sink demands some source message. Connec...
متن کامل