By Topic

Analysis of network error correction based on 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
$33 $33
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

2 Author(s)
K. K. Chi ; Nat. Key Lab. of ISN, Xidian Univ., Xi'an, China ; X. M. Wang

For network error-correcting codes based on network coding an explicit lower bound on the size of source alphabet is presented. This bound is deduced by a Gilbert-Varshamov greedy algorithm. The difficulty of constructing good error-correcting codes for networks is considered and ways of constructing good codes for small-scale networks are dealt with in detail.

Published in:

IEE Proceedings - Communications  (Volume:152 ,  Issue: 4 )