{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,3,13]],"date-time":"2026-03-13T04:53:57Z","timestamp":1773377637229,"version":"3.50.1"},"reference-count":24,"publisher":"IEEE","license":[{"start":{"date-parts":[[2019,7,1]],"date-time":"2019-07-01T00:00:00Z","timestamp":1561939200000},"content-version":"stm-asf","delay-in-days":0,"URL":"https:\/\/doi.org\/10.15223\/policy-029"},{"start":{"date-parts":[[2019,7,1]],"date-time":"2019-07-01T00:00:00Z","timestamp":1561939200000},"content-version":"stm-asf","delay-in-days":0,"URL":"https:\/\/doi.org\/10.15223\/policy-037"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2019,7]]},"DOI":"10.1109\/isit.2019.8849620","type":"proceedings-article","created":{"date-parts":[[2019,9,26]],"date-time":"2019-09-26T21:46:12Z","timestamp":1569534372000},"page":"862-866","source":"Crossref","is-referenced-by-count":3,"title":["Network Coding Solutions for the Combination Network and its Subgraphs"],"prefix":"10.1109","author":[{"given":"Han","family":"Cai","sequence":"first","affiliation":[{"name":"Electrical & Computer Engineering, Ben-Gurion University of the Negev, Israel"}]},{"given":"Tuvi","family":"Etzion","sequence":"additional","affiliation":[{"name":"Computer Science, Technion – Israel Institute of Technology, Israel"}]},{"given":"Moshe","family":"Schwartz","sequence":"additional","affiliation":[{"name":"Electrical & Computer Engineering, Ben-Gurion University of the Negev, Israel"}]},{"given":"Antonia","family":"Wachter-Zeh","sequence":"additional","affiliation":[{"name":"Institute for Communications Engineering, Technical University of Munich, Germany"}]}],"member":"263","reference":[{"key":"ref10","doi-asserted-by":"publisher","DOI":"10.1109\/TIT.2010.2095232"},{"key":"ref11","doi-asserted-by":"publisher","DOI":"10.1109\/TIT.2018.2797183"},{"key":"ref12","doi-asserted-by":"publisher","DOI":"10.1109\/TIT.2005.864435"},{"key":"ref13","doi-asserted-by":"publisher","DOI":"10.1007\/s10623-015-0155-6"},{"key":"ref14","doi-asserted-by":"publisher","DOI":"10.1016\/0097-3165(86)90063-4"},{"key":"ref15","doi-asserted-by":"crossref","first-page":"1973","DOI":"10.1109\/TIT.2005.847712","article-title":"Polynomial time algorithms for multicast network code construction","volume":"51","author":"jaggi","year":"2005","journal-title":"IEEE Trans Inform Theory"},{"key":"ref16","doi-asserted-by":"publisher","DOI":"10.1109\/TIT.2002.807285"},{"key":"ref17","doi-asserted-by":"publisher","DOI":"10.1023\/A:1005052007006"},{"key":"ref18","author":"macwilliams","year":"1978","journal-title":"The Theory of Error-Correcting Codes"},{"key":"ref19","doi-asserted-by":"crossref","DOI":"10.37236\/3573","article-title":"Colorful subhypergraphs in Kneser hypergraph","volume":"21","author":"meunier","year":"2014","journal-title":"The Electronic Journal of Combinatorics"},{"key":"ref4","doi-asserted-by":"publisher","DOI":"10.1016\/S0195-6698(13)80110-2"},{"key":"ref3","doi-asserted-by":"publisher","DOI":"10.1112\/plms\/83.3.532"},{"key":"ref6","doi-asserted-by":"publisher","DOI":"10.1007\/s10623-011-9513-1"},{"key":"ref5","doi-asserted-by":"publisher","DOI":"10.1109\/18.485722"},{"key":"ref8","doi-asserted-by":"publisher","DOI":"10.1109\/TIT.2010.2054295"},{"key":"ref7","doi-asserted-by":"publisher","DOI":"10.1016\/j.jcta.2005.01.010"},{"key":"ref2","author":"apostol","year":"1976","journal-title":"Introduction to Analytic Number Theory"},{"key":"ref1","doi-asserted-by":"publisher","DOI":"10.1109\/18.850663"},{"key":"ref9","doi-asserted-by":"publisher","DOI":"10.1109\/TIT.2010.2094930"},{"key":"ref20","author":"raghavarao","year":"1971","journal-title":"Construction of Combinatorial Problems in Design Experiments"},{"key":"ref22","doi-asserted-by":"publisher","DOI":"10.1007\/11889342_56"},{"key":"ref21","first-page":"142","article-title":"Complexity classification of network information flow problems","author":"rasala lehman","year":"2004","journal-title":"Proc 15th Annu ACM\/SIAM Symp Disc Alg (SODA)"},{"key":"ref24","doi-asserted-by":"publisher","DOI":"10.1109\/ISIT.2017.8006644"},{"key":"ref23","doi-asserted-by":"publisher","DOI":"10.1006\/jcta.2001.3188"}],"event":{"name":"2019 IEEE International Symposium on Information Theory (ISIT)","location":"Paris, France","start":{"date-parts":[[2019,7,7]]},"end":{"date-parts":[[2019,7,12]]}},"container-title":["2019 IEEE International Symposium on Information Theory (ISIT)"],"original-title":[],"link":[{"URL":"http:\/\/xplorestaging.ieee.org\/ielx7\/8827389\/8849208\/08849620.pdf?arnumber=8849620","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2026,3,12]],"date-time":"2026-03-12T20:34:43Z","timestamp":1773347683000},"score":1,"resource":{"primary":{"URL":"https:\/\/ieeexplore.ieee.org\/document\/8849620\/"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2019,7]]},"references-count":24,"URL":"https:\/\/doi.org\/10.1109\/isit.2019.8849620","relation":{},"subject":[],"published":{"date-parts":[[2019,7]]}}}