Reducing Computational Overhead of Network Coding with Intrinsic Information Conveying

Janus Heide, Qi Zhang, Morten V. Pedersen, Frank H. P. Fitzek

    Research output: Contribution to conferencePaperResearch


    This paper investigated the possibility of intrinsic information conveying in network coding systems. The information is embedded into the coding vector by constructing the vector based on a set of predefined rules. This information can subsequently be retrieved by any receiver.
    The starting point is RLNC (Random Linear Network Coding) and the goal is to reduce the amount of coding operations both at the coding and decoding node, and at the same time remove the need for dedicated signaling messages. In a traditional RLNC system, coding operation takes up significant computational resources and adds to the overall energy consumption, which is particular problematic for mobile battery-driven devices.
    In RLNC coding is performed over a FF (Finite Field). We propose to divide this field into sub fields, and let each sub field signify some information or state. In order to embed the information correctly the coding operations must be performed in a particular way, which we introduce. Finally we evaluate the suggested system and find that the amount of coding can be significantly reduced both at nodes that recode and decode.
    Translated title of the contributionReducing Computational Overhead of Network Coding with Intrinsic Information Conveying
    Original languageEnglish
    Publication date2011
    Number of pages5
    Publication statusPublished - 2011
    EventIEEE 74th Vehicular Technology Conference - San Francisco, United States
    Duration: 5 Sept 20118 Sept 2011
    Conference number: 74


    ConferenceIEEE 74th Vehicular Technology Conference
    Country/TerritoryUnited States
    CitySan Francisco

    Cite this