Name
Abstract | ||
|---|---|---|
Recent algorithmic developments have enabled computers to automatically determine and prove the capacity regions of small hypergraph networks under network coding. A structural theory relating network coding problems of different sizes is developed to make the best use of this newfound computational capability. A formal notion of network minimality is developed, which removes components of a netwo... |
Year | DOI | Venue |
|---|---|---|
2015 | 10.1109/TIT.2017.2745620 | IEEE Transactions on Information Theory |
Keywords | Field | DocType |
Network coding,Random variables,Databases,Encoding,Complexity theory,Software algorithms | Linear network coding,Discrete mathematics,Embedding,Computer science,Hypergraph,Theoretical computer science,Equivalence (measure theory),Equivalence class,Hierarchy,Computation,Structural theory | Journal |
Volume | Issue | ISSN |
63 | 11 | 0018-9448 |
Citations | PageRank | References |
5 | 0.49 | 29 |
Authors | ||
3 | ||
Name | Order | Citations | PageRank |
|---|---|---|---|
| Congduan Li | 1 | 12 | 3.00 |
| Steven Weber | 2 | 724 | 53.55 |
| John MacLaren Walsh | 3 | 107 | 17.90 |