{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,3,13]],"date-time":"2026-03-13T04:59:22Z","timestamp":1773377962448,"version":"3.50.1"},"reference-count":50,"publisher":"IEEE","license":[{"start":{"date-parts":[[2022,6,26]],"date-time":"2022-06-26T00:00:00Z","timestamp":1656201600000},"content-version":"stm-asf","delay-in-days":0,"URL":"https:\/\/doi.org\/10.15223\/policy-029"},{"start":{"date-parts":[[2022,6,26]],"date-time":"2022-06-26T00:00:00Z","timestamp":1656201600000},"content-version":"stm-asf","delay-in-days":0,"URL":"https:\/\/doi.org\/10.15223\/policy-037"}],"funder":[{"DOI":"10.13039\/501100004853","name":"Chinese University of Hong Kong","doi-asserted-by":"publisher","id":[{"id":"10.13039\/501100004853","id-type":"DOI","asserted-by":"publisher"}]}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2022,6,26]]},"DOI":"10.1109\/isit50566.2022.9834871","type":"proceedings-article","created":{"date-parts":[[2022,8,3]],"date-time":"2022-08-03T15:34:22Z","timestamp":1659540862000},"page":"31-36","source":"Crossref","is-referenced-by-count":0,"title":["The Undecidability of Network Coding with some Fixed-Size Messages and Edges"],"prefix":"10.1109","author":[{"given":"Cheuk Ting","family":"Li","sequence":"first","affiliation":[{"name":"The Chinese University of Hong Kong,Department of Information Engineering"}]}],"member":"263","reference":[{"key":"ref39","doi-asserted-by":"publisher","DOI":"10.1109\/TIT.2010.2103753"},{"key":"ref38","article-title":"First-order theory of probabilistic independence and single-letter characterizations of capacity regions","author":"li","year":"2021"},{"key":"ref33","article-title":"Non-Shannon information inequalities in four random variables","author":"dougherty","year":"2011"},{"key":"ref32","first-page":"2116","article-title":"A projection method for derivation of non-Shannon-type information inequalities","author":"xu","year":"2008","journal-title":"2008 IEEE ISIT"},{"key":"ref31","first-page":"41","article-title":"Infinitely many information inequalities","author":"mat\u00fa\u0161","year":"2007","journal-title":"IEEE ISIT 2007"},{"key":"ref30","doi-asserted-by":"publisher","DOI":"10.1109\/ISIT.2006.261840"},{"key":"ref37","article-title":"Decision problems in information theory","author":"khamis","year":"2020"},{"key":"ref36","article-title":"On the theory of polynomial information inequalities","author":"g\u00f3mez r\u00edos","year":"2018","journal-title":"Ph D Dissertation"},{"key":"ref35","doi-asserted-by":"publisher","DOI":"10.1504\/IJICOT.2017.081456"},{"key":"ref34","doi-asserted-by":"publisher","DOI":"10.1109\/ITW48936.2021.9611489"},{"key":"ref28","doi-asserted-by":"publisher","DOI":"10.1109\/TIT.2012.2201340"},{"key":"ref27","author":"yeung","year":"2008","journal-title":"Information Theory and Network Coding"},{"key":"ref29","doi-asserted-by":"publisher","DOI":"10.4310\/CIS.2002.v2.n2.a3"},{"key":"ref2","doi-asserted-by":"publisher","DOI":"10.1109\/TIT.2002.807285"},{"key":"ref1","doi-asserted-by":"publisher","DOI":"10.1109\/18.850663"},{"key":"ref20","article-title":"Representability of matroids by c-arrangements is undecidable","author":"k\u00fchne","year":"2019"},{"key":"ref22","doi-asserted-by":"publisher","DOI":"10.1109\/TIT.2010.2048502"},{"key":"ref21","doi-asserted-by":"publisher","DOI":"10.1109\/ISIT.2009.5205943"},{"key":"ref24","doi-asserted-by":"publisher","DOI":"10.1109\/18.641561"},{"key":"ref23","doi-asserted-by":"publisher","DOI":"10.2307\/2275184"},{"key":"ref26","doi-asserted-by":"publisher","DOI":"10.1109\/18.681320"},{"key":"ref25","doi-asserted-by":"publisher","DOI":"10.1109\/18.641556"},{"key":"ref50","article-title":"The undecidability of network coding with some fixed-size messages and edges","author":"li","year":"2021"},{"key":"ref10","doi-asserted-by":"publisher","DOI":"10.1109\/TIT.2006.874434"},{"key":"ref11","doi-asserted-by":"publisher","DOI":"10.1109\/TIT.2010.2094910"},{"key":"ref40","doi-asserted-by":"publisher","DOI":"10.1109\/TIT.2009.2023702"},{"key":"ref12","first-page":"142","article-title":"Complexity classification of network information flow problems","author":"lehman","year":"2004","journal-title":"Proceedings of the Fifteenth Annual ACM-SIAM Symposium on Discrete Algorithms"},{"key":"ref13","first-page":"499","article-title":"Network coding: Does the model need tuning?","volume":"5","author":"lehman","year":"2005","journal-title":"SODA"},{"key":"ref14","doi-asserted-by":"publisher","DOI":"10.1109\/ALLERTON.2009.5394818"},{"key":"ref15","doi-asserted-by":"publisher","DOI":"10.1109\/TIT.2005.864474"},{"key":"ref16","article-title":"Is network coding undecidable?","author":"dougherty","year":"2009","journal-title":"Applications of Matroid Theory and Combinatorial Optimization to Information and Coding Theory"},{"key":"ref17","doi-asserted-by":"publisher","DOI":"10.1109\/JPROC.2010.2095490"},{"key":"ref18","doi-asserted-by":"publisher","DOI":"10.1109\/SURV.2013.013013.00104"},{"key":"ref19","doi-asserted-by":"publisher","DOI":"10.1109\/NETCOD.2014.6892127"},{"key":"ref4","article-title":"Deterministic network coding by matrix completion","author":"harvey","year":"2005","journal-title":"Ph D Dissertation"},{"key":"ref3","doi-asserted-by":"publisher","DOI":"10.1109\/TIT.2005.847712"},{"key":"ref6","doi-asserted-by":"publisher","DOI":"10.1109\/TIT.2006.881746"},{"key":"ref5","doi-asserted-by":"crossref","first-page":"2184","DOI":"10.1109\/INFCOM.2005.1498493","article-title":"On achieving optimal throughput with network coding","volume":"3","author":"li","year":"2005","journal-title":"Proceedings IEEE 24th Annual Joint Conference of the IEEE Computer and Communications Societies"},{"key":"ref8","doi-asserted-by":"publisher","DOI":"10.1109\/TIT.2008.928963"},{"key":"ref7","doi-asserted-by":"publisher","DOI":"10.1109\/TIT.2005.851744"},{"key":"ref49","doi-asserted-by":"publisher","DOI":"10.25088\/ComplexSystems.25.4.297"},{"key":"ref9","article-title":"Network coding","author":"lehman","year":"2005","journal-title":"Ph D Dissertation"},{"key":"ref46","doi-asserted-by":"publisher","DOI":"10.1112\/plms\/s2-42.1.230"},{"key":"ref45","doi-asserted-by":"publisher","DOI":"10.1016\/S0012-365X(98)00203-9"},{"key":"ref48","article-title":"The busy beaver competition: a historical survey","author":"michel","year":"2009"},{"key":"ref47","first-page":"34","article-title":"FPGA implementation of network coding decoder","volume":"10","author":"yoon","year":"2010","journal-title":"IJCSNS Int Jou Of Comp Sci and Net Secu"},{"key":"ref42","doi-asserted-by":"publisher","DOI":"10.1002\/j.1538-7305.1961.tb03975.x"},{"key":"ref41","doi-asserted-by":"publisher","DOI":"10.1109\/TIT.2015.2414926"},{"key":"ref44","doi-asserted-by":"publisher","DOI":"10.1007\/BF00971620"},{"key":"ref43","doi-asserted-by":"publisher","DOI":"10.1090\/memo\/0066"}],"event":{"name":"2022 IEEE International Symposium on Information Theory (ISIT)","location":"Espoo, Finland","start":{"date-parts":[[2022,6,26]]},"end":{"date-parts":[[2022,7,1]]}},"container-title":["2022 IEEE International Symposium on Information Theory (ISIT)"],"original-title":[],"link":[{"URL":"http:\/\/xplorestaging.ieee.org\/ielx7\/9834325\/9834269\/09834871.pdf?arnumber=9834871","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2026,3,12]],"date-time":"2026-03-12T20:35:41Z","timestamp":1773347741000},"score":1,"resource":{"primary":{"URL":"https:\/\/ieeexplore.ieee.org\/document\/9834871\/"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2022,6,26]]},"references-count":50,"URL":"https:\/\/doi.org\/10.1109\/isit50566.2022.9834871","relation":{},"subject":[],"published":{"date-parts":[[2022,6,26]]}}}