{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,3,13]],"date-time":"2026-03-13T04:59:00Z","timestamp":1773377940543,"version":"3.50.1"},"reference-count":34,"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"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2022,6,26]]},"DOI":"10.1109\/isit50566.2022.9834733","type":"proceedings-article","created":{"date-parts":[[2022,8,3]],"date-time":"2022-08-03T15:34:22Z","timestamp":1659540862000},"page":"1151-1156","source":"Crossref","is-referenced-by-count":6,"title":["Capacity of 3-user Linear Computation Broadcast over F\n                    <sub>q<\/sub>\n                    with 1D Demand and Side-Information"],"prefix":"10.1109","author":[{"given":"Yuhang","family":"Yao","sequence":"first","affiliation":[{"name":"University of California,Irvine Center for Pervasive Communication and Computing (CPCC)"}]},{"given":"Syed A.","family":"Jafar","sequence":"additional","affiliation":[{"name":"University of California,Irvine Center for Pervasive Communication and Computing (CPCC)"}]}],"member":"263","reference":[{"key":"ref33","doi-asserted-by":"publisher","DOI":"10.1017\/S0963548309990642"},{"key":"ref32","doi-asserted-by":"publisher","DOI":"10.1109\/TIT.2008.926344"},{"key":"ref31","doi-asserted-by":"publisher","DOI":"10.1109\/TIT.2008.2006447"},{"key":"ref30","doi-asserted-by":"publisher","DOI":"10.1109\/TIT.2014.2338865"},{"key":"ref34","doi-asserted-by":"publisher","DOI":"10.1109\/TIT.2014.2322861"},{"key":"ref10","doi-asserted-by":"publisher","DOI":"10.1109\/JSAC.2013.130404"},{"key":"ref11","doi-asserted-by":"publisher","DOI":"10.1109\/TIT.2014.2332464"},{"key":"ref12","doi-asserted-by":"publisher","DOI":"10.1109\/TIT.2010.2095070"},{"key":"ref13","doi-asserted-by":"publisher","DOI":"10.1109\/TIT.2013.2252052"},{"key":"ref14","doi-asserted-by":"publisher","DOI":"10.1109\/TIT.2013.2283075"},{"key":"ref15","doi-asserted-by":"publisher","DOI":"10.1109\/TIT.2019.2893107"},{"key":"ref16","doi-asserted-by":"publisher","DOI":"10.1109\/TIT.2019.2959760"},{"key":"ref17","doi-asserted-by":"publisher","DOI":"10.1109\/TIT.2010.2103753"},{"key":"ref18","doi-asserted-by":"publisher","DOI":"10.1109\/TIT.2006.874540"},{"key":"ref19","doi-asserted-by":"publisher","DOI":"10.1109\/TIT.2010.2048502"},{"key":"ref28","doi-asserted-by":"publisher","DOI":"10.1109\/TIT.2009.2023702"},{"key":"ref4","doi-asserted-by":"publisher","DOI":"10.1109\/18.340481"},{"key":"ref27","doi-asserted-by":"publisher","DOI":"10.1137\/1038003"},{"key":"ref3","doi-asserted-by":"publisher","DOI":"10.1109\/TIT.1979.1056022"},{"key":"ref6","doi-asserted-by":"publisher","DOI":"10.1109\/TIT.2010.2050835"},{"key":"ref29","doi-asserted-by":"publisher","DOI":"10.1109\/FOCS.2011.39"},{"key":"ref5","doi-asserted-by":"publisher","DOI":"10.1109\/18.915643"},{"key":"ref8","doi-asserted-by":"publisher","DOI":"10.1109\/JSAC.2005.843543"},{"key":"ref7","doi-asserted-by":"publisher","DOI":"10.1109\/TIT.2011.2169532"},{"key":"ref2","doi-asserted-by":"publisher","DOI":"10.1109\/TIT.1976.1055607"},{"key":"ref9","doi-asserted-by":"publisher","DOI":"10.1109\/TIT.2012.2188883"},{"key":"ref1","article-title":"The Next Hyper &#x2014; Connected Experience for All","author":"research","year":"2020","journal-title":"White Paper"},{"key":"ref20","doi-asserted-by":"crossref","first-page":"163","DOI":"10.1561\/0100000094","article-title":"On the Capacity Region for Index Coding","volume":"14","author":"arbabjolfaei","year":"2018","journal-title":"Foundations and Trends in Communications and Information Theory"},{"key":"ref22","doi-asserted-by":"publisher","DOI":"10.1109\/TIT.2016.2555950"},{"key":"ref21","doi-asserted-by":"publisher","DOI":"10.1109\/ISIT.2011.6034247"},{"key":"ref24","doi-asserted-by":"crossref","first-page":"5547","DOI":"10.1109\/TIT.2019.2912184","article-title":"Linear programming approximations for index coding","volume":"65","author":"birk","year":"2019","journal-title":"IEEE Trans Inf Theory"},{"key":"ref23","doi-asserted-by":"publisher","DOI":"10.1109\/TIT.2013.2285151"},{"key":"ref26","doi-asserted-by":"publisher","DOI":"10.1109\/LCOMM.2015.2388477"},{"key":"ref25","article-title":"Index coding via linear programming","author":"blasiak","year":"2010"}],"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\/09834733.pdf?arnumber=9834733","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2026,3,12]],"date-time":"2026-03-12T20:35:37Z","timestamp":1773347737000},"score":1,"resource":{"primary":{"URL":"https:\/\/ieeexplore.ieee.org\/document\/9834733\/"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2022,6,26]]},"references-count":34,"URL":"https:\/\/doi.org\/10.1109\/isit50566.2022.9834733","relation":{},"subject":[],"published":{"date-parts":[[2022,6,26]]}}}