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 January 22, 2010 | Published
Book Section - Chapter Open

Network error correction with unequal link capacities

Abstract

We study network error correction with unequal link capacities. Previous results on network error correction assume unit 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 network consisting of parallel links, and a generalized Singleton outer bound for any arbitrary network. We show by example that linear coding is insufficient for achieving capacity in general. In our example, the capacity is 50% greater than the linear coding capacity and we achieve using a nonlinear error detection strategy. We also present a method for finding an upper bound on the linear coding capacity for arbitrary network. We show that even for a single source and single sink network, it may be necessary for intermediate nodes to do coding, nonlinear error detection or error correction. This is unlike the equal link capacity case, where coding only at the source and forwarding at intermediate nodes suffices for a single source and sink network. We conjecture that the generalized Singleton outer bound is not achievable in general.

Additional Information

© 2009 IEEE. This work is partly supported under a subcontract #069153 issued by BAE Systems National Security Solutions, Inc. and supported by the Defense Advanced Research Projects Agency (DARPA) and the Space and Naval Warfare System Center (SPAWARSYSCEN), San Diego under Contract No. N66001-08-C-2013. We thank Nitin Vaidya for pointing out an error in a previous version of this paper.

Attached Files

Published - Kim2009p109362009_47Th_Annual_Allerton_Conference_On_Communication_Control_And_Computing_Vols_1_And_2.pdf

Files

Kim2009p109362009_47Th_Annual_Allerton_Conference_On_Communication_Control_And_Computing_Vols_1_And_2.pdf

Additional details

Created:
August 19, 2023
Modified:
October 20, 2023