Name
Abstract | ||
|---|---|---|
We derive a new linear network coding algorithm for two-unicast-Z networks over directed acyclic graphs, that is, for two-unicast networks where one destination has apriori information of the interfering source message. Our algorithm discovers linear network codes for two-unicast-Z networks by combining ideas of random linear network coding and interference neutralization. We show that our algorithm outputs an optimal network code for networks where there is only one edge emanating from each of the two sources. The complexity of our algorithm is polynomial in the number of edges of the graph. |
Year | DOI | Venue |
|---|---|---|
2014 | 10.1109/ITW.2014.6970887 | ITW |
Keywords | Field | DocType |
random codes,two-unicast-z networks,linear codes,optimal network code,source message,polynomial,random linear network coding algorithm,directed graphs,directed acyclic graphs,network coding,recursive coding algorithm,interference,vectors,polynomials,indexes,encoding | Linear network coding,Tunstall coding,Discrete mathematics,Computer science,Theoretical computer science,Directed acyclic graph,Coding theory,Huffman coding,Unicast,Shannon–Fano coding,Variable-length code | Conference |
ISSN | Citations | PageRank |
1662-9019 | 1 | 0.36 |
References | Authors | |
7 | 3 | |
Name | Order | Citations | PageRank |
|---|---|---|---|
| Weifei Zeng | 1 | 39 | 3.13 |
| Viveck R. Cadambe | 2 | 1287 | 103.82 |
| Muriel Médard | 3 | 6828 | 599.31 |