{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,5,3]],"date-time":"2026-05-03T02:35:45Z","timestamp":1777775745393,"version":"3.51.4"},"reference-count":50,"publisher":"Emerald","issue":"1","content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2007,6,10]]},"abstract":"<jats:p>Network coding is an elegant and novel technique introduced at the turn of the millennium to improve network throughput and performance. It is expected to be a critical technology for networks of the future. This tutorial addresses the first most natural questions one would ask about this new technique: how network coding works and what are its benefits, how network codes are designed and how much it costs to deploy networks implementing such codes, and finally, whether there are methods to deal with cycles and delay that are present in all real networks. A companion issue deals primarily with applications of network coding.<\/jats:p>","DOI":"10.1561\/1300000003","type":"journal-article","created":{"date-parts":[[2007,6,12]],"date-time":"2007-06-12T09:49:52Z","timestamp":1181641792000},"page":"1-138","source":"Crossref","is-referenced-by-count":145,"title":["Network Coding Fundamentals"],"prefix":"10.1108","volume":"2","author":[{"given":"Christina","family":"Fragouli","sequence":"first","affiliation":[{"name":"\u00e9cole Polytechnique F\u00e9d\u00e9rale de Lausanne (EPFL) ,","place":["Switzerland"]}],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Emina","family":"Soljanin","sequence":"additional","affiliation":[{"name":"Bell Laboratories , Alcatel-Lucent,","place":["USA"]}],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"140","published-online":{"date-parts":[[2007,6,10]]},"reference":[{"key":"2026032901020217700_ref001","volume-title":"IEEE Information Theory Workshop","author":"Agarwal","year":"2004"},{"key":"2026032901020217700_ref002","doi-asserted-by":"crossref","first-page":"1204","DOI":"10.1109\/18.850663","article-title":"Network information flow","volume":"vol. 46","author":"Ahlswede","year":"2000","journal-title":"IEEE Transactions on Information Theory"},{"key":"2026032901020217700_ref003","doi-asserted-by":"crossref","first-page":"1649","DOI":"10.1109\/18.476237","article-title":"On the size of arcs in projective spaces","volume":"vol. 41","author":"Ali","year":"1995","journal-title":"IEEE Transaction on Information Theory"},{"key":"2026032901020217700_ref004","volume-title":"Handbooks in Operations Research and Management Science","author":"Ball","year":"1994"},{"key":"2026032901020217700_ref005","doi-asserted-by":"crossref","first-page":"155","DOI":"10.1137\/S0036142993226983","article-title":"Preserving and increasing local edge-connectivity in mixed graphs","volume":"vol. 8","author":"Bang-Jensen","year":"1995","journal-title":"SIAM Journal on Discrete Mathematics"},{"key":"2026032901020217700_ref006","article-title":"Heuristic algorithms for small field multicast encoding","volume-title":"2006 IEEE International Symposium Information Theory (ISIT\u201906)","author":"Barbero","year":"2006"},{"key":"2026032901020217700_ref007","doi-asserted-by":"crossref","first-page":"2795","DOI":"10.1109\/TIT.2006.874542","article-title":"Cycle-logical treatment for cyclopathic networks","volume":"vol. 52","author":"Barbero","year":"2006","journal-title":"Joint special issue of the IEEE Transactions on Information Theory and the IEEE\/ACM Transaction on Networking"},{"key":"2026032901020217700_ref008","volume-title":"Modern Graph Theory","author":"Bollob\u00b4as","year":"2002"},{"key":"2026032901020217700_ref009","volume-title":"Graph Theory with Applications","author":"Bondy","year":"1979"},{"key":"2026032901020217700_ref010","doi-asserted-by":"crossref","DOI":"10.1017\/CBO9780511804441","volume-title":"Convex Optimization","author":"Boyd","year":"2004"},{"issue":"3","key":"2026032901020217700_ref011","doi-asserted-by":"crossref","first-page":"777","DOI":"10.1109\/TIT.2005.864474","article-title":"Network routing capacity","volume":"vol. 52","author":"Cannons","year":"2006","journal-title":"IEEE Transactions on Information Theory"},{"key":"2026032901020217700_ref012","article-title":"Network coding capacity with a constrained number of coding nodes","volume-title":"Allerton Conference on Communication, Control, and Computing Allerton Park","author":"Cannons","year":"2006"},{"key":"2026032901020217700_ref013","doi-asserted-by":"crossref","DOI":"10.1109\/ISIT.2005.1523639","article-title":"Network coding for non-uniform demands","volume-title":"2005 IEEE International Symposium Information Theory (ISIT 2005)","author":"Cassuto","year":"2005"},{"key":"2026032901020217700_ref014","doi-asserted-by":"crossref","DOI":"10.1109\/ISIT.2006.261718","article-title":"On achievable information rates in single-source non-uniform demand networks","volume-title":"IEEE International Symposium on Information Theory","author":"Chekuri","year":"2006"},{"key":"2026032901020217700_ref015","doi-asserted-by":"crossref","first-page":"2410","DOI":"10.1109\/TIT.2006.874433","article-title":"On average throughput benefits and alphabet size for network coding","volume":"vol. 52","author":"Chekuri","year":"2006","journal-title":"Joint Special Issue of the IEEE Transactions on Information Theory and the IEEE\/ACM Transactions on Networking"},{"key":"2026032901020217700_ref016","article-title":"Practical network coding","volume-title":"Allerton Conference on Communication, Control, and Computing","author":"Chou","year":"2003"},{"key":"2026032901020217700_ref017","volume-title":"Elements of Information Theory","author":"Cover","year":"1991"},{"key":"2026032901020217700_ref018","volume-title":"Graph Theory","author":"Diestel","year":"2000"},{"issue":"8","key":"2026032901020217700_ref019","doi-asserted-by":"crossref","first-page":"2745","DOI":"10.1109\/TIT.2005.851744","article-title":"Insufficiency of linear coding in network information flow","volume":"vol. 51","author":"Dougherty","year":"2005","journal-title":"IEEE Transactions on Information Theory"},{"key":"2026032901020217700_ref020","doi-asserted-by":"crossref","first-page":"117","DOI":"10.1109\/TIT.1956.1056816","article-title":"Note on maximum flow through a network","volume":"vol. 2","author":"Elias","year":"1956","journal-title":"IRE Transaction on Information Theory"},{"key":"2026032901020217700_ref021","doi-asserted-by":"crossref","DOI":"10.1109\/ISIT.2004.1365183","article-title":"Convolutional network codes","volume-title":"IEEE International Symposium on Information Theory (ISIT)","author":"Erez","year":"2004"},{"key":"2026032901020217700_ref022","doi-asserted-by":"crossref","first-page":"399","DOI":"10.4153\/CJM-1956-045-5","article-title":"Maximal flow through a network","volume":"vol. 8","author":"Ford","year":"1956","journal-title":"Canadian Journal of Mathematics"},{"key":"2026032901020217700_ref023","first-page":"661","article-title":"A connection between network coding and convolutional codes","volume-title":"IEEE International Conference on Communications (ICC)","author":"Fragouli","year":"2004"},{"key":"2026032901020217700_ref024","doi-asserted-by":"crossref","first-page":"829","DOI":"10.1109\/TIT.2005.864435","article-title":"Information flow decomposition for network coding","volume":"vol. 52","author":"Fragouli","year":"2006","journal-title":"IEEE Transactions on Information Theory"},{"key":"2026032901020217700_ref025","unstructured":"N.\n              Harvey\n            \n          , \u201cDeterministic network coding by matrix completion,\u201d MS Thesis, 2005."},{"key":"2026032901020217700_ref026","doi-asserted-by":"crossref","first-page":"4413","DOI":"10.1109\/TIT.2006.881746","article-title":"A random linear network coding approach to multicast","volume":"vol. 52","author":"Ho","year":"2006","journal-title":"IEEE Transactions on Information Theory"},{"key":"2026032901020217700_ref027","volume-title":"1st Workshop on Network Coding","author":"Ho","year":"2005"},{"key":"2026032901020217700_ref028","doi-asserted-by":"crossref","DOI":"10.1109\/ISIT.2006.261594","article-title":"Low complexity encoding for network codes","volume-title":"Proceedings of 2006 IEEE International Symposium Information Theory (ISIT\u201906)","author":"Jaggi","year":"2006"},{"key":"2026032901020217700_ref029","volume-title":"ISIT 2003","author":"Jaggi"},{"issue":"6","key":"2026032901020217700_ref030","doi-asserted-by":"crossref","first-page":"1973","DOI":"10.1109\/TIT.2005.847712","article-title":"Polynomial time algorithms for multicast network code construction","volume":"vol. 51","author":"Jaggi","year":"2005","journal-title":"IEEE Transaction on Information Theory"},{"key":"2026032901020217700_ref031","article-title":"On minimizing network coding resources: An evolutionary approach","volume-title":"Network Coding Workshop","author":"Kim","year":"2006"},{"key":"2026032901020217700_ref032","doi-asserted-by":"crossref","first-page":"782","DOI":"10.1109\/TNET.2003.818197","article-title":"Beyond routing: An algebraic approach to network coding","volume":"vol. 11","author":"K\u00f6tter","year":"2003","journal-title":"IEEE\/ACM Transaction on Networking"},{"key":"2026032901020217700_ref033","doi-asserted-by":"crossref","DOI":"10.1109\/ISIT.2004.1365070","article-title":"Cut sets and information flow in networks of two-way channels","volume-title":"Proceedings of 2004 IEEE International Symposium Information Theory (ISIT 2004)","author":"Kramer","year":"2004"},{"key":"2026032901020217700_ref034","doi-asserted-by":"crossref","first-page":"2386","DOI":"10.1109\/TIT.2006.874434","article-title":"The encoding complexity of network coding","volume":"vol. 52","author":"Langberg","year":"2006","journal-title":"Joint special issue of the IEEE Transactions on Information Theory and the IEEE\/ACM Transaction on Networking"},{"key":"2026032901020217700_ref035","article-title":"Complexity classification of network information flow problems","volume-title":"SODA","author":"Lehman","year":"2004"},{"key":"2026032901020217700_ref036","doi-asserted-by":"crossref","first-page":"371","DOI":"10.1109\/TIT.2002.807285","article-title":"Linear network coding","volume":"vol. 49","author":"Li","year":"2003","journal-title":"IEEE Transactions on Information Theory"},{"key":"2026032901020217700_ref037","article-title":"On achieving optimal multicast throughput in undirected networks","volume":"vol. 52","author":"Li","year":"2006","journal-title":"Joint Special Issue on Networking and Information Theory, IEEE Transactions on Information Theory (IT) and IEEE\/ACM Transactions on Networking (TON)"},{"key":"2026032901020217700_ref038","doi-asserted-by":"crossref","first-page":"2608","DOI":"10.1109\/TIT.2006.874523","article-title":"Minimum-cost multicast over coded packet networks","volume":"vol. 52","author":"Lun","year":"2006","journal-title":"IEEE Transactions on Information Theory"},{"key":"2026032901020217700_ref039","volume-title":"Handbook of Coding Theory","author":"McEliece","year":"1998"},{"key":"2026032901020217700_ref040","doi-asserted-by":"crossref","first-page":"95","DOI":"10.4064\/fm-10-1-96-115","article-title":"Zur allgemeinen Kurventheorie","volume":"vol. 10","author":"Menger","year":"1927","journal-title":"Fundamenta Mathematicae"},{"key":"2026032901020217700_ref041","first-page":"142","article-title":"Complexity classification of network information flow problems","volume-title":"SODA","author":"Rasala-Lehman","year":"2004"},{"key":"2026032901020217700_ref042","article-title":"Linear versus nonlinear boolean functions in network flow","volume-title":"Proceedings of 38th Annual Conference on Information Sciences and Systems (CISS\u201904)","author":"Riis","year":"2004"},{"key":"2026032901020217700_ref043","doi-asserted-by":"crossref","DOI":"10.1145\/777412.777464","article-title":"Polynomial time algorithms for network information flow","volume-title":"Proceedings of 15th ACM Symposium on Parallel Algorithms and Architectures","author":"Sanders","year":"2003"},{"key":"2026032901020217700_ref044","volume-title":"Theory of Linear and Integer Programming","author":"Schrijver","year":"1998"},{"key":"2026032901020217700_ref045","doi-asserted-by":"crossref","first-page":"701","DOI":"10.1145\/322217.322225","article-title":"Fast probabilistic algorithms for verification of polynomial identities","volume":"vol. 27","author":"Schwartz","year":"1980","journal-title":"Journal of the ACM"},{"key":"2026032901020217700_ref046","volume-title":"Modern Computer Algebra","author":"von zur Gathen","year":"2003"},{"key":"2026032901020217700_ref047","article-title":"A comparison of network coding and tree packing","volume-title":"ISIT 2004","author":"Wu","year":"2004"},{"key":"2026032901020217700_ref048","doi-asserted-by":"crossref","first-page":"412","DOI":"10.1109\/18.370142","article-title":"Multilevel diversity coding with distortion","volume":"vol. 41","author":"Yeung","year":"1995","journal-title":"IEEE Transaction on Information Theory"},{"key":"2026032901020217700_ref049","doi-asserted-by":"crossref","first-page":"241","DOI":"10.1561\/0100000007I","article-title":"Network coding theory: A tutorial","volume":"vol. 2","author":"Yeung","year":"2006","journal-title":"Foundation and Trends in Communications and Information Theory"},{"key":"2026032901020217700_ref050","first-page":"59","article-title":"On directed Steiner trees","volume-title":"Proceedings of the 13th Annual ACM\/SIAM Symposium on Discrete Algorithms (SODA)","author":"Zosin","year":"2002"}],"container-title":["Foundations and Trends\u00ae in Networking"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/www.emerald.com\/ftnet\/article-pdf\/2\/1\/1\/10905170\/1300000003en.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"syndication"},{"URL":"https:\/\/www.emerald.com\/ftnet\/article-pdf\/2\/1\/1\/10905170\/1300000003en.pdf","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2026,4,29]],"date-time":"2026-04-29T18:13:48Z","timestamp":1777486428000},"score":1,"resource":{"primary":{"URL":"https:\/\/www.emerald.com\/ftnet\/article\/2\/1\/1\/1321257\/Network-Coding-Fundamentals"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2007,6,10]]},"references-count":50,"journal-issue":{"issue":"1","published-print":{"date-parts":[[2007,6,10]]}},"URL":"https:\/\/doi.org\/10.1561\/1300000003","relation":{},"ISSN":["1554-057X","1554-0588"],"issn-type":[{"value":"1554-057X","type":"print"},{"value":"1554-0588","type":"electronic"}],"subject":[],"published":{"date-parts":[[2007,6,10]]}}}