000058339 001__ 58339
000058339 005__ 20180925194017.0
000058339 037__ $$aREP_WORK
000058339 245__ $$aNetwork Coding: An Instant Primer
000058339 269__ $$a2005
000058339 260__ $$c2005
000058339 336__ $$aReports
000058339 520__ $$aNetwork coding is a  new research area that may have interesting applications in practical networking systems. With network coding, intermediate nodes may send out packets that are linear combinations of previously received information. There are two main benefits of this approach: potential throughput improvements and a high degree of robustness. Robustness translates into  loss resilience and facilitates the design of simple distributed algorithms that perform well, even if decisions are based only on partial information. This paper is an instant primer on network coding: we explain what network coding does and how it does it.  We also discuss the implications of theoretical results on network coding for realistic settings and show how network coding can be used in practice.
000058339 6531_ $$aNetwork Coding
000058339 6531_ $$aAd-Hoc Networks
000058339 6531_ $$aWLN
000058339 700__ $$0240968$$aFragouli, Christina$$g161832
000058339 700__ $$0241098$$aLe Boudec, Jean-Yves$$g105633
000058339 700__ $$0241364$$aWidmer, Jorg$$g159966
000058339 8564_ $$s131523$$uhttps://infoscience.epfl.ch/record/58339/files/rt.pdf$$zn/a
000058339 909C0 $$0252614$$pLCA$$xUS00024
000058339 909C0 $$0252185$$pARNI$$xU11353
000058339 909C0 $$0252453$$pLCA2$$xU10427
000058339 909CO $$ooai:infoscience.tind.io:58339$$pIC$$preport$$qGLOBAL_SET
000058339 937__ $$aLCA-REPORT-2005-010
000058339 973__ $$aEPFL$$sPUBLISHED
000058339 980__ $$aREPORT