Name
Abstract | ||
|---|---|---|
We approach the problem of linear network coding for multicast networks from different perspectives. We introduce the notion of the coding points of a network, which are edges of the network where messages combine and coding occurs. We give an integer linear program that leads to choices of paths through the network that minimize the number of coding points. We introduce the code graph of a network, a simplified directed graph that maintains the information essential to understanding the coding properties of the network. One of the main problems in network coding is to understand when the capacity of a multicast network is achieved with linear network coding over a finite field of size q. We explain how this problem can be interpreted in terms of rational points on certain algebraic varieties. |
Year | Venue | Field |
|---|---|---|
2017 | arXiv: Information Theory | Linear network coding,Integer,Discrete mathematics,Finite field,Directed graph,Network simulation,Coding (social sciences),Theoretical computer science,Linear programming,Multicast,Mathematics |
DocType | Volume | Citations |
Journal | abs/1701.05944 | 0 |
PageRank | References | Authors |
0.34 | 1 | 7 |
Name | Order | Citations | PageRank |
|---|---|---|---|
| Sarah E. Anderson | 1 | 6 | 2.22 |
| Wael Halbawi | 2 | 30 | 3.00 |
| Nathan Kaplan | 3 | 0 | 0.34 |
| Hiram H. López | 4 | 20 | 4.81 |
| Felice Manganiello | 5 | 16 | 5.09 |
| Emina Soljanin | 6 | 708 | 61.35 |
| Judy L. Walker | 7 | 93 | 9.96 |