A recursive coding algorithm for two-unicast-Z networks

Weifei Zeng, Viveck Cadambe, Muriel Médard

    Research output: Chapter in Book/Report/Conference proceedingConference contribution

    1 Scopus citations

    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.

    Original languageEnglish (US)
    Title of host publication2014 IEEE Information Theory Workshop, ITW 2014
    PublisherInstitute of Electrical and Electronics Engineers Inc.
    Pages526-530
    Number of pages5
    ISBN (Electronic)9781479959990
    DOIs
    StatePublished - Dec 1 2014
    Event2014 IEEE Information Theory Workshop, ITW 2014 - Hobart, Australia
    Duration: Nov 2 2014Nov 5 2014

    Publication series

    Name2014 IEEE Information Theory Workshop, ITW 2014

    Other

    Other2014 IEEE Information Theory Workshop, ITW 2014
    CountryAustralia
    CityHobart
    Period11/2/1411/5/14

    All Science Journal Classification (ASJC) codes

    • Information Systems
    • Computer Networks and Communications

    Fingerprint Dive into the research topics of 'A recursive coding algorithm for two-unicast-Z networks'. Together they form a unique fingerprint.

    Cite this