Welcome to the new version of CaltechAUTHORS. Login is currently restricted to library staff. If you notice any issues, please email coda@library.caltech.edu
Published February 2011 | public
Journal Article

Network Error Correction With Unequal Link Capacities

Abstract

This paper studies the capacity of single-source single-sink noiseless networks under adversarial or arbitrary errors on no more than z edges. Unlike prior papers, which assume equal capacities on all links, arbitrary link capacities are considered. Results include new upper bounds, network error-correction coding strategies, and examples of network families where our bounds are tight. An example is provided of a network where the capacity is 50% greater than the best rate that can be achieved with linear coding. While coding at the source and sink suffices in networks with equal link capacities, in networks with unequal link capacities, it is shown that intermediate nodes may have to do coding, nonlinear error detection, or error correction in order to achieve the network error-correction capacity.

Additional Information

© 2011 IEEE. Manuscript received April 16, 2010; revised August 07, 2010; accepted September 24, 2010. Date of current version January 19, 2011. This work was supported in part by Subcontract #069153 issued by BAE Systems National Security Solutions, Inc. and by the Defense Advanced Research Projects Agency (DARPA) and the Space and Naval Warfare System Center (SPAWARSYSCEN), San Diego under Contract N66001-08-C-2013, by the National Science Foundation under Grant CNS 0905615, and by the California Institute of Technology Lee Center for Advanced Networking. The work of A. S. Avestimehr was supported in part by the NSF CAREER award 0953117. This paper is part of the special issue on "Facets of Coding Theory: From Algorithms to Networks," dedicated to the scientific legacy of Ralf Koetter. The authors would like to thank the reviewers for their very insightful and detailed suggestions that were most helpful in improving this paper.

Additional details

Created:
August 22, 2023
Modified:
October 23, 2023