{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,2,21]],"date-time":"2025-02-21T09:55:09Z","timestamp":1740131709654,"version":"3.37.3"},"reference-count":43,"publisher":"Institute of Electrical and Electronics Engineers (IEEE)","issue":"3","license":[{"start":{"date-parts":[[2020,3,1]],"date-time":"2020-03-01T00:00:00Z","timestamp":1583020800000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/ieeexplore.ieee.org\/Xplorehelp\/downloads\/license-information\/IEEE.html"},{"start":{"date-parts":[[2020,3,1]],"date-time":"2020-03-01T00:00:00Z","timestamp":1583020800000},"content-version":"am","delay-in-days":0,"URL":"https:\/\/ieeexplore.ieee.org\/Xplorehelp\/downloads\/license-information\/IEEE.html"},{"start":{"date-parts":[[2020,3,1]],"date-time":"2020-03-01T00:00:00Z","timestamp":1583020800000},"content-version":"stm-asf","delay-in-days":0,"URL":"https:\/\/doi.org\/10.15223\/policy-029"},{"start":{"date-parts":[[2020,3,1]],"date-time":"2020-03-01T00:00:00Z","timestamp":1583020800000},"content-version":"stm-asf","delay-in-days":0,"URL":"https:\/\/doi.org\/10.15223\/policy-037"}],"funder":[{"DOI":"10.13039\/100000001","name":"National Science Foundation","doi-asserted-by":"publisher","award":["CCF-1320895"],"award-info":[{"award-number":["CCF-1320895"]}],"id":[{"id":"10.13039\/100000001","id-type":"DOI","asserted-by":"publisher"}]},{"name":"Korean Ministry of Science, ICT and Future Planning through the Institute for Information and Communications Technology Promotion","award":["B0132-15-1005"],"award-info":[{"award-number":["B0132-15-1005"]}]}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":["IEEE Trans. Inform. Theory"],"published-print":{"date-parts":[[2020,3]]},"DOI":"10.1109\/tit.2019.2961919","type":"journal-article","created":{"date-parts":[[2019,12,25]],"date-time":"2019-12-25T02:04:27Z","timestamp":1577239467000},"page":"1520-1529","source":"Crossref","is-referenced-by-count":1,"title":["Generalized Lexicographic Products and the Index Coding Capacity"],"prefix":"10.1109","volume":"66","author":[{"ORCID":"https:\/\/orcid.org\/0000-0003-1297-8121","authenticated-orcid":false,"given":"Fatemeh","family":"Arbabjolfaei","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"ORCID":"https:\/\/orcid.org\/0000-0001-7255-8757","authenticated-orcid":false,"given":"Young-Han","family":"Kim","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"263","reference":[{"key":"ref39","doi-asserted-by":"publisher","DOI":"10.1109\/ISIT.2016.7541680"},{"key":"ref38","doi-asserted-by":"publisher","DOI":"10.1109\/TIT.2011.2155618"},{"key":"ref33","doi-asserted-by":"publisher","DOI":"10.1017\/S0004972700007760"},{"key":"ref32","doi-asserted-by":"publisher","DOI":"10.1007\/BFb0066438"},{"key":"ref31","doi-asserted-by":"publisher","DOI":"10.1109\/ISIT.2015.7282612"},{"key":"ref30","doi-asserted-by":"publisher","DOI":"10.1109\/JSAC.2014.2384294"},{"key":"ref37","doi-asserted-by":"publisher","DOI":"10.1109\/FOCS.2008.41"},{"journal-title":"Linear programming duality An introduction to oriented matroids","year":"1992","author":"bachem","key":"ref36"},{"journal-title":"Fractional Graph Theory A Rational Approach to the Theory of Graphs","year":"2011","author":"scheinerman","key":"ref35"},{"key":"ref34","doi-asserted-by":"publisher","DOI":"10.1201\/b10959"},{"key":"ref10","doi-asserted-by":"publisher","DOI":"10.1109\/TIT.2006.874540"},{"key":"ref40","doi-asserted-by":"publisher","DOI":"10.1002\/j.1538-7305.1948.tb01338.x"},{"key":"ref11","doi-asserted-by":"publisher","DOI":"10.37236\/962"},{"key":"ref12","doi-asserted-by":"publisher","DOI":"10.1109\/ISIT.2008.4595303"},{"key":"ref13","doi-asserted-by":"publisher","DOI":"10.1109\/TIT.2015.2414926"},{"key":"ref14","doi-asserted-by":"publisher","DOI":"10.1109\/ISIT.2014.6875179"},{"key":"ref15","doi-asserted-by":"publisher","DOI":"10.1109\/ISIT.2014.6874842"},{"key":"ref16","doi-asserted-by":"publisher","DOI":"10.1109\/ALLERTON.2015.7447094"},{"key":"ref17","doi-asserted-by":"publisher","DOI":"10.1109\/TIT.2018.2795019"},{"key":"ref18","doi-asserted-by":"publisher","DOI":"10.1109\/ISIT.2015.7282481"},{"key":"ref19","doi-asserted-by":"publisher","DOI":"10.1109\/INFCOM.2012.6195768"},{"key":"ref28","doi-asserted-by":"publisher","DOI":"10.1109\/ISIT.2013.6620369"},{"key":"ref4","doi-asserted-by":"publisher","DOI":"10.1109\/Allerton.2011.6120342"},{"key":"ref27","doi-asserted-by":"crossref","first-page":"164","DOI":"10.1561\/0100000094","article-title":"Fundamentals of index coding","volume":"14","author":"arbabjolfaei","year":"2018","journal-title":"Found Trends Commun Inf Theory"},{"key":"ref3","doi-asserted-by":"publisher","DOI":"10.1109\/ISIT.2010.5513732"},{"key":"ref6","doi-asserted-by":"publisher","DOI":"10.1109\/ITW.1989.761406"},{"key":"ref29","doi-asserted-by":"publisher","DOI":"10.1109\/FOCS.2011.39"},{"key":"ref5","doi-asserted-by":"crossref","first-page":"98","DOI":"10.1109\/PROC.1978.10848","article-title":"on increasing the down-link capacity of a regenerative satellite repeater in point-to-point communications","volume":"66","author":"celebiler","year":"1978","journal-title":"Proceedings of the IEEE"},{"key":"ref8","doi-asserted-by":"publisher","DOI":"10.1109\/18.370142"},{"key":"ref7","doi-asserted-by":"publisher","DOI":"10.1109\/TIT.2002.1003820"},{"key":"ref2","doi-asserted-by":"publisher","DOI":"10.1017\/CBO9781139030687"},{"key":"ref9","doi-asserted-by":"publisher","DOI":"10.1109\/INFCOM.1998.662940"},{"key":"ref1","first-page":"339","article-title":"The maximal-error and average-error capacity region of the broadcast channel are identical: A direct proof","volume":"19","author":"willems","year":"1990","journal-title":"Probl Control Inf Theory"},{"key":"ref20","doi-asserted-by":"publisher","DOI":"10.1109\/TIT.2013.2285151"},{"key":"ref22","doi-asserted-by":"publisher","DOI":"10.1109\/TIT.2015.2504556"},{"key":"ref21","doi-asserted-by":"publisher","DOI":"10.1109\/TIT.2014.2306938"},{"key":"ref42","doi-asserted-by":"publisher","DOI":"10.1109\/18.915643"},{"article-title":"A graph-theoretic approach to network coding","year":"2013","author":"blasiak","key":"ref24"},{"journal-title":"Elements of Information Theory","year":"2006","author":"cover","key":"ref41"},{"article-title":"Network and index coding with application to robust and secure communications","year":"2009","author":"el rouayheb","key":"ref23"},{"key":"ref26","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-319-70293-3_10"},{"key":"ref43","first-page":"142","article-title":"Coding theorems for a discrete source with a fidelity criterion","volume":"7","author":"shannon","year":"1959","journal-title":"Proc IRE"},{"article-title":"Index coding: Fundamental limits, coding schemes, and structural properties","year":"2017","author":"arbabjolfaei","key":"ref25"}],"container-title":["IEEE Transactions on Information Theory"],"original-title":[],"link":[{"URL":"https:\/\/ieeexplore.ieee.org\/ielam\/18\/8999759\/8941142-aam.pdf","content-type":"application\/pdf","content-version":"am","intended-application":"syndication"},{"URL":"http:\/\/xplorestaging.ieee.org\/ielx7\/18\/8999759\/08941142.pdf?arnumber=8941142","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2022,4,27]],"date-time":"2022-04-27T17:30:03Z","timestamp":1651080603000},"score":1,"resource":{"primary":{"URL":"https:\/\/ieeexplore.ieee.org\/document\/8941142\/"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2020,3]]},"references-count":43,"journal-issue":{"issue":"3"},"URL":"https:\/\/doi.org\/10.1109\/tit.2019.2961919","relation":{},"ISSN":["0018-9448","1557-9654"],"issn-type":[{"type":"print","value":"0018-9448"},{"type":"electronic","value":"1557-9654"}],"subject":[],"published":{"date-parts":[[2020,3]]}}}