{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,6,18]],"date-time":"2025-06-18T04:28:04Z","timestamp":1750220884016,"version":"3.41.0"},"reference-count":43,"publisher":"Association for Computing Machinery (ACM)","issue":"5","license":[{"start":{"date-parts":[[2019,11,8]],"date-time":"2019-11-08T00:00:00Z","timestamp":1573171200000},"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":[[2019,11,8]]},"abstract":"<jats:p>While placing the paper \"XORs in the Air\" in the context of the theoretical and practical understanding of network coding, we present a view of the progress of the field of network coding, In particular, we examine the interplay of theory and practice in the field.<\/jats:p>","DOI":"10.1145\/3371934.3371959","type":"journal-article","created":{"date-parts":[[2019,11,8]],"date-time":"2019-11-08T20:27:58Z","timestamp":1573244878000},"page":"77-81","update-policy":"https:\/\/doi.org\/10.1145\/crossmark-policy","source":"Crossref","is-referenced-by-count":3,"title":["XORs in the past and future"],"prefix":"10.1145","volume":"49","author":[{"given":"Muriel","family":"M\u00e9dard","sequence":"first","affiliation":[{"name":"MIT"}]},{"given":"Sachin","family":"Katti","sequence":"additional","affiliation":[{"name":"Stanford"}]},{"given":"Dina","family":"Katabi","sequence":"additional","affiliation":[{"name":"MIT"}]},{"given":"Wenjun","family":"Hu","sequence":"additional","affiliation":[{"name":"Yale"}]},{"given":"Hariharan","family":"Rahul","sequence":"additional","affiliation":[{"name":"MIT"}]},{"given":"Jon","family":"Crowcroft","sequence":"additional","affiliation":[{"name":"Cambridge University"}]}],"member":"320","published-online":{"date-parts":[[2019,11,8]]},"reference":[{"key":"e_1_2_1_1_1","unstructured":"http:\/\/www.steinwurf.com\/products\/kodo.html.  http:\/\/www.steinwurf.com\/products\/kodo.html."},{"volume-title":"Proc. 1st Workshop on Network Coding, Theory, and Applications (Netcod'05)","author":"Aceda\u0144ski S.","key":"e_1_2_1_2_1","unstructured":"S. Aceda\u0144ski , S. Deb , M. M\u00e9dard , and R. Koetter . 2005. How good is random linear coding based distributed network storage? . In Proc. 1st Workshop on Network Coding, Theory, and Applications (Netcod'05) . S. Aceda\u0144ski, S. Deb, M. M\u00e9dard, and R. Koetter. 2005. How good is random linear coding based distributed network storage?. In Proc. 1st Workshop on Network Coding, Theory, and Applications (Netcod'05)."},{"key":"e_1_2_1_3_1","doi-asserted-by":"publisher","DOI":"10.1109\/18.850663"},{"key":"e_1_2_1_4_1","doi-asserted-by":"crossref","unstructured":"R. Ahlswede Cai Ning S-Y.R Li and R.W. Yeung. 2000. Network information flow. 46 4 (July 2000) 1204--1216.  R. Ahlswede Cai Ning S-Y.R Li and R.W. Yeung. 2000. Network information flow. 46 4 (July 2000) 1204--1216.","DOI":"10.1109\/18.850663"},{"key":"e_1_2_1_5_1","doi-asserted-by":"publisher","DOI":"10.1109\/ICC.2019.8761983"},{"key":"e_1_2_1_6_1","doi-asserted-by":"publisher","DOI":"10.1109\/JSAC.2012.120213"},{"key":"e_1_2_1_7_1","doi-asserted-by":"publisher","DOI":"10.1109\/TNET.2018.2865534"},{"key":"e_1_2_1_8_1","doi-asserted-by":"publisher","DOI":"10.1109\/TNET.2017.2746755"},{"key":"e_1_2_1_9_1","doi-asserted-by":"publisher","DOI":"10.1109\/TIT.2014.2329840"},{"key":"e_1_2_1_10_1","doi-asserted-by":"publisher","DOI":"10.1109\/ACCESS.2018.2865137"},{"key":"e_1_2_1_11_1","unstructured":"J. Heide S. Shi K. Fouli M. M\u00e9dard and V. Chook. [n. d.]. Random Linear Network Coding (RLNC): Background and Practical Considerations https:\/\/datatracker.ietf.org\/doc\/draft-heide-nwcrg-rlnc-background\/.  J. Heide S. Shi K. Fouli M. M\u00e9dard and V. Chook. [n. d.]. Random Linear Network Coding (RLNC): Background and Practical Considerations https:\/\/datatracker.ietf.org\/doc\/draft-heide-nwcrg-rlnc-background\/."},{"key":"e_1_2_1_12_1","unstructured":"J. Heide S. Shi K. Fouli M. M\u00e9dard and V. Chook. [n. d.]. Random Linear Network Coding (RLNC)-Based Symbol Representation https:\/\/tools.ietf.org\/html\/draft-heide-nwcrg-rlnc-02.  J. Heide S. Shi K. Fouli M. M\u00e9dard and V. Chook. [n. d.]. Random Linear Network Coding (RLNC)-Based Symbol Representation https:\/\/tools.ietf.org\/html\/draft-heide-nwcrg-rlnc-02."},{"key":"e_1_2_1_13_1","doi-asserted-by":"publisher","DOI":"10.1109\/CLOUD.2016.0119"},{"key":"e_1_2_1_14_1","doi-asserted-by":"publisher","DOI":"10.1109\/TIT.2006.881746"},{"key":"e_1_2_1_15_1","doi-asserted-by":"publisher","DOI":"10.1109\/JSAC.2017.2710958"},{"key":"e_1_2_1_16_1","doi-asserted-by":"publisher","DOI":"10.1145\/1159913.1159942"},{"key":"e_1_2_1_17_1","doi-asserted-by":"publisher","DOI":"10.1109\/TNET.2008.923722"},{"key":"e_1_2_1_18_1","doi-asserted-by":"publisher","DOI":"10.1109\/ISIT.2001.935967"},{"key":"e_1_2_1_19_1","doi-asserted-by":"publisher","DOI":"10.1109\/INFCOM.2002.1019253"},{"key":"e_1_2_1_20_1","doi-asserted-by":"publisher","DOI":"10.1109\/TNET.2003.818197"},{"key":"e_1_2_1_21_1","volume-title":"Minimum-cost multicast over coded packet networks. 52, 6 (June","author":"Lun Desmond","year":"2006","unstructured":"Desmond Lun , Niranjan Ratnakar , Muriel M\u00e9dard , Ralf Koetter , David R. Karger , Tracey H, Ebad Amhed , and Fang Zhao . 2006. Minimum-cost multicast over coded packet networks. 52, 6 (June 2006 ), 2608--2623. Desmond Lun, Niranjan Ratnakar, Muriel M\u00e9dard, Ralf Koetter, David R. Karger, Tracey H, Ebad Amhed, and Fang Zhao. 2006. Minimum-cost multicast over coded packet networks. 52, 6 (June 2006), 2608--2623."},{"volume-title":"International Symposium on Information Theory and its Applications (ISITA).","author":"Lun D. S.","key":"e_1_2_1_22_1","unstructured":"D. S. Lun , M. M\u00e9dard , T. Ho , and R. Koetter . 2004. Network coding with a cost criterion . In International Symposium on Information Theory and its Applications (ISITA). D. S. Lun, M. M\u00e9dard, T. Ho, and R. Koetter. 2004. Network coding with a cost criterion. In International Symposium on Information Theory and its Applications (ISITA)."},{"key":"e_1_2_1_23_1","doi-asserted-by":"publisher","DOI":"10.1109\/WIOPT.2006.1666502"},{"key":"e_1_2_1_24_1","doi-asserted-by":"publisher","DOI":"10.1109\/GLOCOM.2018.8648058"},{"key":"e_1_2_1_25_1","doi-asserted-by":"publisher","DOI":"10.1109\/JSAC.2019.2898747"},{"key":"e_1_2_1_26_1","doi-asserted-by":"publisher","DOI":"10.1109\/WF-IoT.2019.8767270"},{"key":"e_1_2_1_27_1","doi-asserted-by":"publisher","DOI":"10.1109\/MCOM.2014.6852100"},{"key":"e_1_2_1_28_1","volume-title":"Babel Storage: Uncoordinated Content Delivery from Multiple Coded Storage Systems","author":"Neu J.","year":"2019","unstructured":"J. Neu and M. Medard . 2019 . Babel Storage: Uncoordinated Content Delivery from Multiple Coded Storage Systems . IEEE Globecom ( 2019). J. Neu and M. Medard. 2019. Babel Storage: Uncoordinated Content Delivery from Multiple Coded Storage Systems. IEEE Globecom (2019)."},{"key":"e_1_2_1_29_1","doi-asserted-by":"publisher","DOI":"10.1109\/CCNC.2018.8319326"},{"key":"e_1_2_1_30_1","volume-title":"Deterministic Broadcasting and Random Linear Network Coding in Mobile Ad Hoc Networks. CoRR abs\/1411.4465","author":"Papanikos Nikolaos","year":"2014","unstructured":"Nikolaos Papanikos and Evangelos Papapetrou . 2014. Deterministic Broadcasting and Random Linear Network Coding in Mobile Ad Hoc Networks. CoRR abs\/1411.4465 ( 2014 ). arXiv:1411.4465 http:\/\/arxiv.org\/abs\/1411.4465 Nikolaos Papanikos and Evangelos Papapetrou. 2014. Deterministic Broadcasting and Random Linear Network Coding in Mobile Ad Hoc Networks. CoRR abs\/1411.4465 (2014). arXiv:1411.4465 http:\/\/arxiv.org\/abs\/1411.4465"},{"key":"e_1_2_1_31_1","unstructured":"V. Roca. [n. d.]. The Sliding Window Random Linear Code (RLC) Forward Erasure Correction (FEC) Scheme for FECFRAME https:\/\/tools.ietf.org\/html\/draft-roca-tsvwg-rlc-fec-scheme-01.  V. Roca. [n. d.]. The Sliding Window Random Linear Code (RLC) Forward Erasure Correction (FEC) Scheme for FECFRAME https:\/\/tools.ietf.org\/html\/draft-roca-tsvwg-rlc-fec-scheme-01."},{"key":"e_1_2_1_32_1","doi-asserted-by":"publisher","DOI":"10.1109\/ICC.2017.7996675"},{"key":"e_1_2_1_33_1","doi-asserted-by":"publisher","DOI":"10.1109\/JPROC.2010.2093850"},{"key":"e_1_2_1_34_1","doi-asserted-by":"publisher","DOI":"10.1109\/INFCOM.2009.5061931"},{"key":"e_1_2_1_35_1","doi-asserted-by":"publisher","DOI":"10.1109\/NETCOD.2009.5437470"},{"key":"e_1_2_1_36_1","unstructured":"M. Talas R. Rausch and N. Barhoum. 2018. New York City Pilot Acquisition and Installation Experiences. (2018).  M. Talas R. Rausch and N. Barhoum. 2018. New York City Pilot Acquisition and Installation Experiences. (2018)."},{"key":"e_1_2_1_37_1","unstructured":"F. Tesema and V. Pauli. 2018. Layer 2 FEC in 5G Broadcast \/ Multicast Networks http:\/\/nomor.de\/wp-content\/uploads\/2018\/09\/Nomor_WhitePaper_2018_FT_VP_RAN_2nd_layer_FEC_v3.pdf. (2018).  F. Tesema and V. Pauli. 2018. Layer 2 FEC in 5G Broadcast \/ Multicast Networks http:\/\/nomor.de\/wp-content\/uploads\/2018\/09\/Nomor_WhitePaper_2018_FT_VP_RAN_2nd_layer_FEC_v3.pdf. (2018)."},{"key":"e_1_2_1_38_1","unstructured":"F. Tesema and V. Pauli. 2019. Coordinated Link Adaptation and Higher Layer Error Correction for 5G Broadcast \/ Multicast http:\/\/nomor.de\/wp-content\/uploads\/2019\/07\/white_paper_coord_la_and_ec.pdf. (2019).  F. Tesema and V. Pauli. 2019. Coordinated Link Adaptation and Higher Layer Error Correction for 5G Broadcast \/ Multicast http:\/\/nomor.de\/wp-content\/uploads\/2019\/07\/white_paper_coord_la_and_ec.pdf. (2019)."},{"key":"e_1_2_1_39_1","doi-asserted-by":"publisher","DOI":"10.1109\/WD.2017.7918148"},{"key":"e_1_2_1_40_1","doi-asserted-by":"publisher","DOI":"10.1109\/ACCESS.2017.2757241"},{"key":"e_1_2_1_41_1","doi-asserted-by":"publisher","DOI":"10.1109\/SECON.2012.6275806"},{"key":"e_1_2_1_42_1","doi-asserted-by":"publisher","DOI":"10.1109\/ITA.2010.5454107"},{"key":"e_1_2_1_43_1","doi-asserted-by":"publisher","DOI":"10.1109\/NETCOD.2012.6261882"}],"container-title":["ACM SIGCOMM Computer Communication Review"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/dl.acm.org\/doi\/10.1145\/3371934.3371959","content-type":"unspecified","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/dl.acm.org\/doi\/pdf\/10.1145\/3371934.3371959","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2025,6,17]],"date-time":"2025-06-17T23:44:19Z","timestamp":1750203859000},"score":1,"resource":{"primary":{"URL":"https:\/\/dl.acm.org\/doi\/10.1145\/3371934.3371959"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2019,11,8]]},"references-count":43,"journal-issue":{"issue":"5","published-print":{"date-parts":[[2019,11,8]]}},"alternative-id":["10.1145\/3371934.3371959"],"URL":"https:\/\/doi.org\/10.1145\/3371934.3371959","relation":{},"ISSN":["0146-4833"],"issn-type":[{"type":"print","value":"0146-4833"}],"subject":[],"published":{"date-parts":[[2019,11,8]]},"assertion":[{"value":"2019-11-08","order":2,"name":"published","label":"Published","group":{"name":"publication_history","label":"Publication History"}}]}}