{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2024,9,5]],"date-time":"2024-09-05T08:27:02Z","timestamp":1725524822292},"reference-count":14,"publisher":"IEEE","content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2018,6]]},"DOI":"10.1109\/isit.2018.8437330","type":"proceedings-article","created":{"date-parts":[[2018,8,17]],"date-time":"2018-08-17T20:14:55Z","timestamp":1534536895000},"page":"601-605","source":"Crossref","is-referenced-by-count":2,"title":["A New Upperbound on the Broadcast Rate and Near-Optimal Vector Linear Codes for Index Coding Problems with Symmetric Neighboring Interference"],"prefix":"10.1109","author":[{"given":"Mahesh Babu","family":"Vaddi","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"B. Sundar","family":"Rajan","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"263","reference":[{"key":"ref10","doi-asserted-by":"publisher","DOI":"10.1109\/GLOCOMW.2016.7848993"},{"journal-title":"Low-complexity decoding for symmetric neighboring and consecutive side-information index coding problems","year":"2017","author":"vaddi","key":"ref11"},{"key":"ref12","article-title":"Capacity of some index coding problems with symmetric neighboring interference","author":"vaddi","year":"2017","journal-title":"proceedings of IEEE ITW 2017 Kaohsuing"},{"journal-title":"Near-optimal vector linear index codes for single unicast index coding problems with symmetric neighboring interference","year":"2017","author":"vaddi","key":"ref13"},{"journal-title":"A new upperbound on the broadcast rate of index coding problems with symmetric neighboring interference","year":"2017","author":"vaddi","key":"ref14"},{"key":"ref4","doi-asserted-by":"publisher","DOI":"10.1109\/ICC.2012.6363722"},{"key":"ref3","doi-asserted-by":"publisher","DOI":"10.1109\/INFCOM.1998.662940"},{"journal-title":"Elementary Number Theory","year":"0","author":"burton","key":"ref6"},{"key":"ref5","doi-asserted-by":"publisher","DOI":"10.1109\/TIT.2013.2264472"},{"key":"ref8","doi-asserted-by":"publisher","DOI":"10.1109\/ISIT.2013.6620407"},{"key":"ref7","doi-asserted-by":"publisher","DOI":"10.1109\/ISIT.2012.6283853"},{"key":"ref2","doi-asserted-by":"publisher","DOI":"10.1109\/TIT.2013.2285151"},{"key":"ref1","doi-asserted-by":"publisher","DOI":"10.1109\/TIT.2014.2338865"},{"key":"ref9","doi-asserted-by":"publisher","DOI":"10.1109\/ISIT.2014.6874840"}],"event":{"name":"2018 IEEE International Symposium on Information Theory (ISIT)","start":{"date-parts":[[2018,6,17]]},"location":"Vail, CO, USA","end":{"date-parts":[[2018,6,22]]}},"container-title":["2018 IEEE International Symposium on Information Theory (ISIT)"],"original-title":[],"link":[{"URL":"http:\/\/xplorestaging.ieee.org\/ielx7\/8410646\/8437120\/08437330.pdf?arnumber=8437330","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2020,8,23]],"date-time":"2020-08-23T22:18:50Z","timestamp":1598221130000},"score":1,"resource":{"primary":{"URL":"https:\/\/ieeexplore.ieee.org\/document\/8437330\/"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2018,6]]},"references-count":14,"URL":"https:\/\/doi.org\/10.1109\/isit.2018.8437330","relation":{},"subject":[],"published":{"date-parts":[[2018,6]]}}}