Notification:
We are currently experiencing intermittent issues impacting performance. We apologize for the inconvenience.
By Topic

New results on network error correction: Capacities and upper bounds

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

4 Author(s)
Sukwon Kim ; Dept. of Electr. Eng., California Inst. of Technol., Pasadena, CA, USA ; Tracey Ho ; Effros, M. ; Avestimehr, S.

In this paper, we present new results on network error correction with unequal link capacities. We consider network error correction codes that can correct arbitrary errors occurring on up to z links. We find the capacity of a two-node network with multiple feedback links and show how feedback links can be used to increase the error correction capacity. We propose a new cut-set upper bound for general acyclic networks, and show its tightness for a family of four-node acyclic networks when each backward link has enough capacity. For a more general family of zig-zag networks, we present conditions under which our upper bound is tight. Finally, we propose an approach for high-probability network error correction with a causal adversary.

Published in:

Information Theory and Applications Workshop (ITA), 2010

Date of Conference:

Jan. 31 2010-Feb. 5 2010