Robust Network Coding for Bidirected Networks


We consider the problem of finding a linear network code that guarantees an instantaneous recovery from edge failures in communication networks. With instantaneous recovery, lost data can be recovered at the destination without the need for path re-routing or packet re-transmission. We focus on a special class of bidirected networks. In such networks, for… (More)


3 Figures and Tables

Cite this paper

@article{Sprintson2007RobustNC, title={Robust Network Coding for Bidirected Networks}, author={Alex Sprintson and S.Y.E. Rouayheb and C. N. Georghiades}, journal={2007 Information Theory and Applications Workshop}, year={2007}, pages={378-383} }