By Topic

Efficient mixed-generation concatenated network coding

Sign In

Cookies must be enabled to login.After enabling cookies , please use refresh or reload or ctrl+f5 on the browser for the login options.

Formats Non-Member Member
$31 $13
Learn how you can qualify for the best price for this item!
Become an IEEE Member or Subscribe to
IEEE Xplore for exclusive pricing!
close button

puzzle piece

IEEE membership options for an individual and IEEE Xplore subscriptions for an organization offer the most affordable access to essential journal articles, conference papers, standards, eBooks, and eLearning courses.

Learn more about:

IEEE membership

IEEE Xplore subscriptions

3 Author(s)
Thibault, J.-P. ; Dept. of Electr. & Comput. Eng., Toronto Univ., Toronto, ON ; Wai-Yip Chan ; Yousefi, S.

Random network coding can be viewed as a single block code applied to all source packets. To manage the concomitant high coding complexity, source packets can be partitioned into generations; block coding is then performed on each set. To reach a better performance-complexity tradeoff, we propose a novel concatenated network code which mixes generations while retaining the desirable properties of generation-based coding. On erasure channels, the resulting probability of successfully decoding a generation can increase substantially; this holds for any erasure rate. We show how the codepsilas parameters can be tuned to extract best performance.

Published in:

Communications, 2008 24th Biennial Symposium on

Date of Conference:

24-26 June 2008