Paper Info
Title
Intrinsic Information Conveying For Network Coding Systems
Abstract
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 Random Linear Network Coding (RLNC) 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 Finite Field (FF). 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.
Year
DOI
Venue
2011
10.1109/VETECF.2011.6093005
2011 IEEE VEHICULAR TECHNOLOGY CONFERENCE (VTC FALL)
Keywords
Field
DocType
network coding,finite element method,indexation,finite field,radio receivers,galois fields,indexes,decoding,vectors,finite element methods,encoding
Linear network coding,Coding tree unit,Context-adaptive variable-length coding,Computer science,Coding (social sciences),Electronic engineering,Theoretical computer science,Shannon–Fano coding,Decoding methods,Context-adaptive binary arithmetic coding,Variable-length code
Conference
ISSN
Citations 
PageRank 
1550-2252
0
0.34
References 
Authors
2
4
Name
Order
Citations
PageRank
Janus Heide115317.00
Morten Videbæk Pedersen220218.49
Frank H. P. Fitzek3706123.89
Qi Zhang412012.36