{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,5,9]],"date-time":"2026-05-09T16:58:00Z","timestamp":1778345880300,"version":"3.51.4"},"reference-count":27,"publisher":"Association for Computing Machinery (ACM)","issue":"1","license":[{"start":{"date-parts":[[2006,1,10]],"date-time":"2006-01-10T00:00:00Z","timestamp":1136851200000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/www.acm.org\/publications\/policies\/copyright_policy#Background"}],"content-domain":{"domain":["dl.acm.org"],"crossmark-restriction":true},"short-container-title":["SIGCOMM Comput. Commun. Rev."],"published-print":{"date-parts":[[2006,1,10]]},"abstract":"<jats:p>Network 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<\/jats:p>","DOI":"10.1145\/1111322.1111337","type":"journal-article","created":{"date-parts":[[2006,2,6]],"date-time":"2006-02-06T18:14:10Z","timestamp":1139249650000},"page":"63-68","update-policy":"https:\/\/doi.org\/10.1145\/crossmark-policy","source":"Crossref","is-referenced-by-count":487,"title":["Network coding"],"prefix":"10.1145","volume":"36","author":[{"given":"Christina","family":"Fragouli","sequence":"first","affiliation":[{"name":"EPFL - IC"}]},{"given":"Jean-Yves","family":"Le Boudec","sequence":"additional","affiliation":[{"name":"EPFL - IC"}]},{"given":"J\u00f6rg","family":"Widmer","sequence":"additional","affiliation":[{"name":"DoCoMo Labs"}]}],"member":"320","published-online":{"date-parts":[[2006,1,10]]},"reference":[{"key":"e_1_2_1_1_1","unstructured":"Avalanche: File swarming with network coding. http:\/\/research.microsoft.com\/pablo\/avalanche.aspx.  Avalanche: File swarming with network coding. http:\/\/research.microsoft.com\/pablo\/avalanche.aspx."},{"key":"e_1_2_1_2_1","doi-asserted-by":"publisher","DOI":"10.1109\/18.850663"},{"key":"e_1_2_1_3_1","volume-title":"NetCod","author":"Bhattad K.","year":"2005","unstructured":"K. Bhattad and K. R. Narayanan . Weakly secure network coding . In NetCod , Apr. 2005 . K. Bhattad and K. R. Narayanan. Weakly secure network coding. In NetCod, Apr. 2005."},{"key":"e_1_2_1_4_1","volume-title":"ISIT","author":"Cai N.","year":"2002","unstructured":"N. Cai and R. W. Yeung . Secure network coding . In ISIT , 2002 . N. Cai and R. W. Yeung. Secure network coding. In ISIT, 2002."},{"key":"e_1_2_1_5_1","author":"Chekuri C.","unstructured":"C. Chekuri , C. Fragouli , and E. Soljanin . On average throughput and alphabet size in network coding. Accepted to IEEE Trans. Inform. Theory. C. Chekuri, C. Fragouli, and E. Soljanin. On average throughput and alphabet size in network coding. Accepted to IEEE Trans. Inform. Theory.","journal-title":"Accepted to IEEE Trans. Inform. Theory."},{"key":"e_1_2_1_6_1","volume-title":"Allerton","author":"Chou P. A.","year":"2003","unstructured":"P. A. Chou , Y. Wu , and K. Jain . Practical network coding . In Allerton , Oct. 2003 . P. A. Chou, Y. Wu, and K. Jain. Practical network coding. In Allerton, Oct. 2003."},{"key":"e_1_2_1_7_1","volume-title":"Allerton","author":"Deb S.","year":"2004","unstructured":"S. Deb and M. Medard . Algebraic gossip: A network coding approach to optimal multiple rumor mongering . In Allerton , Oct. 2004 . S. Deb and M. Medard. Algebraic gossip: A network coding approach to optimal multiple rumor mongering. In Allerton, Oct. 2004."},{"key":"e_1_2_1_8_1","doi-asserted-by":"publisher","DOI":"10.5555\/1147685.1147708"},{"key":"e_1_2_1_9_1","volume-title":"Allerton","author":"Fragouli C.","year":"2005","unstructured":"C. Fragouli and A. Markopoulou . A network coding approach to overlay network monitoring . In Allerton , Sept. 2005 . C. Fragouli and A. Markopoulou. A network coding approach to overlay network monitoring. In Allerton, Sept. 2005."},{"key":"e_1_2_1_10_1","doi-asserted-by":"publisher","DOI":"10.1109\/ITW.2004.1405320"},{"key":"e_1_2_1_12_1","doi-asserted-by":"publisher","DOI":"10.1109\/INFCOM.2005.1498511"},{"key":"e_1_2_1_14_1","doi-asserted-by":"publisher","DOI":"10.1109\/ISIT.2003.1228459"},{"key":"e_1_2_1_15_1","doi-asserted-by":"publisher","DOI":"10.1109\/ISIT.2005.1523691"},{"key":"e_1_2_1_16_1","doi-asserted-by":"publisher","DOI":"10.1109\/ISIT.2004.1365180"},{"key":"e_1_2_1_17_1","volume-title":"Allerton","author":"Katti S.","year":"2005","unstructured":"S. Katti , D. Katabi , W. Hu , H. Rahul , and M. Medard . The importance of being opportunistic: Practical network coding for wireless environments . In Allerton , 2005 . S. Katti, D. Katabi, W. Hu, H. Rahul, and M. Medard. The importance of being opportunistic: Practical network coding for wireless environments. In Allerton, 2005."},{"key":"e_1_2_1_18_1","doi-asserted-by":"publisher","DOI":"10.1109\/TIT.2002.807285"},{"key":"e_1_2_1_19_1","volume-title":"CISS","author":"Li Z.","year":"2004","unstructured":"Z. Li and B. Li . Network coding in undirected networks . CISS , 2004 . Z. Li and B. Li. Network coding in undirected networks. CISS, 2004."},{"key":"e_1_2_1_20_1","volume-title":"Advances in Cryptology","author":"Lim C. H.","year":"1994","unstructured":"C. H. Lim and P. J. Lee . More exible exponentiation with precomputation . In Advances in Cryptology , Aug. 1994 . C. H. Lim and P. J. Lee. More exible exponentiation with precomputation. In Advances in Cryptology, Aug. 1994."},{"key":"e_1_2_1_21_1","volume-title":"Allerton","author":"Lun D. S.","year":"2004","unstructured":"D. S. Lun , M. Medard , and M. Effros . On coding for reliable communication over packet networks . Allerton , 2004 . D. S. Lun, M. Medard, and M. Effros. On coding for reliable communication over packet networks. Allerton, 2004."},{"key":"e_1_2_1_22_1","volume-title":"ISIT","author":"Pakzad P.","year":"2005","unstructured":"P. Pakzad , C. Fragouli , and A. Shokrollahi . On low complexity coding for line networks . ISIT , Australia , Sept. 2005 . P. Pakzad, C. Fragouli, and A. Shokrollahi. On low complexity coding for line networks. ISIT, Australia, Sept. 2005."},{"key":"e_1_2_1_23_1","volume-title":"NetCod","author":"Petrovic D.","year":"2005","unstructured":"D. Petrovic , K. Ramchandran , and J. Rabaey . Overcoming untuned radios in wireless networks with network coding . In NetCod , Italy , Apr. 2005 . D. Petrovic, K. Ramchandran, and J. Rabaey. Overcoming untuned radios in wireless networks with network coding. In NetCod, Italy, Apr. 2005."},{"key":"e_1_2_1_24_1","doi-asserted-by":"publisher","DOI":"10.1145\/777412.777464"},{"key":"e_1_2_1_25_1","author":"Shokrollahi A.","year":"2004","unstructured":"A. Shokrollahi . Raptor codes. Submitted to IEEE Trans. Information Theory , 2004 . A. Shokrollahi. Raptor codes. Submitted to IEEE Trans. Information Theory, 2004.","journal-title":"Trans. Information Theory"},{"key":"e_1_2_1_26_1","unstructured":"N. R. Wagner. The Laws of Cryptography with Java Code. Available online at Neal Wagner's home page.  N. R. Wagner. The Laws of Cryptography with Java Code. Available online at Neal Wagner's home page."},{"key":"e_1_2_1_27_1","volume-title":"NetCod","author":"Widmer J.","year":"2005","unstructured":"J. Widmer , C. Fragouli , and J. Y. LeBoudec . Energy efficient broadcasting in wireless ad hoc networks . In NetCod , Apr. 2005 . J. Widmer, C. Fragouli, and J. Y. LeBoudec. Energy efficient broadcasting in wireless ad hoc networks. In NetCod, Apr. 2005."},{"key":"e_1_2_1_28_1","doi-asserted-by":"publisher","DOI":"10.1145\/1080139.1080147"},{"key":"e_1_2_1_29_1","volume-title":"ISIT","author":"Wu Y.","year":"2004","unstructured":"Y. Wu , P. A. Chou , and K. Jain . A comparison of network coding and tree packing . ISIT , 2004 . Y. Wu, P. A. Chou, and K. Jain. A comparison of network coding and tree packing. ISIT, 2004."}],"container-title":["ACM SIGCOMM Computer Communication Review"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/dl.acm.org\/doi\/10.1145\/1111322.1111337","content-type":"unspecified","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/dl.acm.org\/doi\/pdf\/10.1145\/1111322.1111337","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2025,6,18]],"date-time":"2025-06-18T16:08:39Z","timestamp":1750262919000},"score":1,"resource":{"primary":{"URL":"https:\/\/dl.acm.org\/doi\/10.1145\/1111322.1111337"}},"subtitle":["an instant primer"],"short-title":[],"issued":{"date-parts":[[2006,1,10]]},"references-count":27,"journal-issue":{"issue":"1","published-print":{"date-parts":[[2006,1,10]]}},"alternative-id":["10.1145\/1111322.1111337"],"URL":"https:\/\/doi.org\/10.1145\/1111322.1111337","relation":{},"ISSN":["0146-4833"],"issn-type":[{"value":"0146-4833","type":"print"}],"subject":[],"published":{"date-parts":[[2006,1,10]]},"assertion":[{"value":"2006-01-10","order":2,"name":"published","label":"Published","group":{"name":"publication_history","label":"Publication History"}}]}}