A recursive coding algorithm for two-unicast-Z networks
Name
A recursive.pdf
Size
329.81 KB
Format
Adobe PDF
Checksum (MD5)
8f89457d48c12a79f463d6ef97ca9ad3
Author(s)
Zeng, Weifei
Cadambe, Viveck
Medard, Muriel
Date Issued
November 2014
Journal
Proceedings of the 2014 IEEE Information Theory Workshop (ITW 2014)
Publisher
Institute of Electrical and Electronics Engineers (IEEE)
Citation
Zeng, Weifei, Viveck Cadambe, and Muriel Medard. “A Recursive Coding Algorithm for Two-Unicast-Z Networks.” 2014 IEEE Information Theory Workshop (ITW 2014) (November 2014).
Version
Author's final manuscript
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.
MIT Department
Massachusetts Institute of Technology. Department of Electrical Engineering and Computer Science
Massachusetts Institute of Technology. Research Laboratory of Electronics
Terms of Use
Creative Commons Attribution-Noncommercial-Share Alike
Persistent DSpace Link
DOI of Published Version
https://doi.org/10.1109/ITW.2014.6970887
