Resilient flow decomposition of unicast connections with network coding

  title={Resilient flow decomposition of unicast connections with network coding},
  author={P{\'e}ter Babarczi and J{\'a}nos Tapolcai and Lajos R{\'o}nyai and Muriel M{\'e}dard},
  journal={2014 IEEE International Symposium on Information Theory},
In this paper we close the gap between end-to-end diversity coding and intra-session network coding for unicast connections resilient against single link failures. In particular, we show that coding operations are sufficient to perform at the source and receiver if the user data can be split into at most two parts over the filed GF(2). Our proof is purely combinatorial and based on standard graph and network flow techniques. It is a linear time construction that defines the route of subflows A… CONTINUE READING
Recent Discussions
This paper has been referenced on Twitter 2 times over the past 90 days. VIEW TWEETS
6 Citations
17 References
Similar Papers


Publications referenced by this paper.
Showing 1-10 of 17 references

and C

  • S. Rouayheb, A. Sprintson
  • Georghiades, “Robust n etwork codes for unicast…
  • 2011
Highly Influential
5 Excerpts

and P

  • P. Babarczi, G. Biczók, H. Overby, J. Tapolcai
  • So proni, “Realization strategies of dedicated…
  • 2013

and M

  • P. Babarczi, J. Tapolcai, P.-H. Ho
  • Médard, “Opti mal Dedicated Protection Approach…
  • 2012


  • S. Jaggi, P. Sanders, P. Chou, M. Effros, S. Egner
  • Jain , nd L. Tolhuizen, “Polynomial time…
  • 2005
2 Excerpts


  • A. Markopoulou, G. Iannaccone, S. Bhattacharyya
  • Chu ah, and C. Diot, “Characterization of…
  • 2004
1 Excerpt

Similar Papers

Loading similar papers…