Practically Feasible Design for Convolutional Network Code

Songtao LIANG  Haibin KAN  

Publication
IEICE TRANSACTIONS on Fundamentals of Electronics, Communications and Computer Sciences   Vol.E96-A    No.9    pp.1895-1900
Publication Date: 2013/09/01
Online ISSN: 1745-1337
DOI: 10.1587/transfun.E96.A.1895
Print ISSN: 0916-8508
Type of Manuscript: LETTER
Category: Coding Theory
Keyword: 
convolutional network code,  decoding delay,  decoding matrix,  network coding,  code construction,  

Full Text: PDF>>
Buy this Article



Summary: 
This paper introduces two schemes to put the decoding of the convolutional network code (CNC) into practice, which are named the Intermittent Packet Transmission Scheme (IPTS) and the Redundancy Packet Transmission Scheme (RPTS). According to the decoding formula of the sink nodes, we can see that, at the time k+δ in order to decode the source packet generated at time k, the sink node should know all the source packets generated before k-1. This is impractical. The two schemes we devised make it unnecessary. A construction algorithm is also given about the RPTS networks. For the two schemes, we analyze the strengths and weaknesses and point out their implemented condition.