Campus Units

Electrical and Computer Engineering

Document Type

Conference Proceeding

Conference

2009 IEEE International Symposium on Information Theory. ISIT 2009.

Publication Version

Submitted Manuscript

Link to Published Version

https://doi.org/10.1109/ISIT.2009.5205599

Publication Date

2009

Journal or Book Title

IEEE International Symposium on Information Theory, 2009. ISIT 2009.

First Page

986

Last Page

990

DOI

10.1109/ISIT.2009.5205599

Conference Title

2009 IEEE International Symposium on Information Theory

Conference Date

June 28-July 3, 2009

City

Seoul, South Korea

Abstract

We propose a network-coding based scheme to protect multiple bidirectional unicast connections against adversarial errors and failures in a network. The end nodes of the bidirectional connections are connected by a set of shared protection paths that provide the redundancy required for protection. Suppose that ne paths are corrupted by an omniscient, computationally unbounded adversary. Under our proposed protocol, the errors can be corrected at all the end nodes with 4ne protection paths. More generally, if there are ne adversarial errors and nƒ failures, 4ne + 2nƒ protection paths are sufficient. The number of protection paths only depends on the number of errors and failures being protected against and is independent of the number of unicast connections.

Comments

This is a manuscript of a proceeding from the IEEE International Symposium on Information Theory (2009): 986, doi:10.1109/ISIT.2009.5205599. Posted with permission.

Rights

Personal use of this material is permitted. Permission from IEEE must be obtained for all other uses, in any current or future media, including reprinting/republishing this material for advertising or promotional purposes, creating new collective works, for resale or redistribution to servers or lists, or reuse of any copyrighted component of this work in other works.

Copyright Owner

IEEE

Language

en

File Format

application/pdf

Published Version

Share

Article Location

 
COinS