{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2024,9,7]],"date-time":"2024-09-07T00:27:15Z","timestamp":1725668835547},"reference-count":21,"publisher":"IEEE","license":[{"start":{"date-parts":[[2021,7,12]],"date-time":"2021-07-12T00:00:00Z","timestamp":1626048000000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/ieeexplore.ieee.org\/Xplorehelp\/downloads\/license-information\/IEEE.html"},{"start":{"date-parts":[[2021,7,12]],"date-time":"2021-07-12T00:00:00Z","timestamp":1626048000000},"content-version":"stm-asf","delay-in-days":0,"URL":"https:\/\/doi.org\/10.15223\/policy-029"},{"start":{"date-parts":[[2021,7,12]],"date-time":"2021-07-12T00:00:00Z","timestamp":1626048000000},"content-version":"stm-asf","delay-in-days":0,"URL":"https:\/\/doi.org\/10.15223\/policy-037"}],"funder":[{"DOI":"10.13039\/501100001843","name":"SERB","doi-asserted-by":"publisher","id":[{"id":"10.13039\/501100001843","id-type":"DOI","asserted-by":"publisher"}]},{"DOI":"10.13039\/501100007624","name":"Bharti Centre for Communication at IIT Bombay","doi-asserted-by":"publisher","id":[{"id":"10.13039\/501100007624","id-type":"DOI","asserted-by":"publisher"}]}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2021,7,12]]},"DOI":"10.1109\/isit45174.2021.9517865","type":"proceedings-article","created":{"date-parts":[[2021,9,1]],"date-time":"2021-09-01T20:52:42Z","timestamp":1630529562000},"page":"220-225","source":"Crossref","is-referenced-by-count":1,"title":["On the Optimal Transmission Rate for Symmetric Index Coding Problems"],"prefix":"10.1109","author":[{"given":"Kota Srinivas","family":"Reddy","sequence":"first","affiliation":[]},{"given":"Nujoom Sageer","family":"Karat","sequence":"additional","affiliation":[]},{"given":"Nikhil","family":"Karamchandani","sequence":"additional","affiliation":[]}],"member":"263","reference":[{"key":"ref10","doi-asserted-by":"publisher","DOI":"10.1109\/ISIT.2013.6620407"},{"journal-title":"ArXiv Preprint","article-title":"Local partial clique covers for index coding","year":"2016","author":"agarwal","key":"ref11"},{"key":"ref12","doi-asserted-by":"publisher","DOI":"10.1109\/ISIT.2013.6620369"},{"key":"ref13","doi-asserted-by":"publisher","DOI":"10.1109\/TIT.2013.2285151"},{"key":"ref14","doi-asserted-by":"publisher","DOI":"10.1109\/ITW44776.2019.8989268"},{"key":"ref15","doi-asserted-by":"publisher","DOI":"10.23919\/ISITA.2018.8664378"},{"key":"ref16","doi-asserted-by":"publisher","DOI":"10.1109\/TIT.2017.2662706"},{"journal-title":"ArXiv Preprint","article-title":"Optimal scalar linear index codes for some symmetric multiple unicast problems","year":"2015","author":"vaddi","key":"ref17"},{"journal-title":"IEEE Information Theory Workshop (ITW)","article-title":"Structured index coding problem and multi-access coded caching","year":"0","author":"reddy","key":"ref18"},{"journal-title":"On the optimal transmission rate for symmetric index coding problems","year":"0","author":"reddy","key":"ref19"},{"key":"ref4","doi-asserted-by":"publisher","DOI":"10.1109\/MCOM.2016.7537173"},{"key":"ref3","doi-asserted-by":"publisher","DOI":"10.1109\/TIT.2017.2756959"},{"key":"ref6","doi-asserted-by":"publisher","DOI":"10.1109\/TIT.2010.2103753"},{"key":"ref5","doi-asserted-by":"publisher","DOI":"10.1109\/INFCOM.1998.662940"},{"key":"ref8","doi-asserted-by":"publisher","DOI":"10.1109\/TIT.2013.2264472"},{"key":"ref7","doi-asserted-by":"publisher","DOI":"10.1109\/TIT.2016.2555950"},{"key":"ref2","doi-asserted-by":"publisher","DOI":"10.1109\/TIT.2015.2472521"},{"key":"ref1","doi-asserted-by":"publisher","DOI":"10.1109\/TIT.2015.2414926"},{"key":"ref9","doi-asserted-by":"publisher","DOI":"10.1109\/TIT.2014.2338865"},{"key":"ref20","doi-asserted-by":"publisher","DOI":"10.1109\/ISIT.2018.8437330"},{"key":"ref21","doi-asserted-by":"publisher","DOI":"10.1109\/ITW.2017.8277946"}],"event":{"name":"2021 IEEE International Symposium on Information Theory (ISIT)","start":{"date-parts":[[2021,7,12]]},"location":"Melbourne, Australia","end":{"date-parts":[[2021,7,20]]}},"container-title":["2021 IEEE International Symposium on Information Theory (ISIT)"],"original-title":[],"link":[{"URL":"http:\/\/xplorestaging.ieee.org\/ielx7\/9517708\/9517709\/09517865.pdf?arnumber=9517865","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2022,5,10]],"date-time":"2022-05-10T15:44:57Z","timestamp":1652197497000},"score":1,"resource":{"primary":{"URL":"https:\/\/ieeexplore.ieee.org\/document\/9517865\/"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2021,7,12]]},"references-count":21,"URL":"https:\/\/doi.org\/10.1109\/isit45174.2021.9517865","relation":{},"subject":[],"published":{"date-parts":[[2021,7,12]]}}}
