{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2024,10,22]],"date-time":"2024-10-22T20:13:35Z","timestamp":1729628015684,"version":"3.28.0"},"reference-count":18,"publisher":"IEEE","content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2011,7]]},"DOI":"10.1109\/isit.2011.6034286","type":"proceedings-article","created":{"date-parts":[[2011,10,6]],"date-time":"2011-10-06T13:24:20Z","timestamp":1317907460000},"page":"983-987","source":"Crossref","is-referenced-by-count":7,"title":["On secure Index Coding with Side Information"],"prefix":"10.1109","author":[{"given":"Son Hoang","family":"Dau","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Vitaly","family":"Skachek","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Yeow Meng","family":"Chee","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"263","reference":[{"key":"ref10","doi-asserted-by":"publisher","DOI":"10.1109\/TNET.2003.818197"},{"key":"ref11","doi-asserted-by":"publisher","DOI":"10.1109\/ISIT.2010.5513776"},{"key":"ref12","doi-asserted-by":"publisher","DOI":"10.1109\/ISIT.2007.4557098"},{"key":"ref13","doi-asserted-by":"publisher","DOI":"10.1109\/ISIT.2011.6034286"},{"journal-title":"The Theory of Error-Correcting Codes","year":"1977","author":"macwilliams","key":"ref14"},{"key":"ref15","doi-asserted-by":"crossref","DOI":"10.1007\/978-1-4612-1478-6","author":"hedayat","year":"1999","journal-title":"Orthogonal Arrays Theory and Applications"},{"key":"ref16","doi-asserted-by":"publisher","DOI":"10.1007\/BF01261326"},{"key":"ref17","first-page":"267","article-title":"An upper bound for the shannon capacity of a graph","volume":"25","author":"haerners","year":"1978","journal-title":"Algebr Methods Graph Theory"},{"key":"ref18","doi-asserted-by":"publisher","DOI":"10.1002\/j.1538-7305.1984.tb00072.x"},{"key":"ref4","doi-asserted-by":"publisher","DOI":"10.1109\/FOCS.2006.42"},{"key":"ref3","doi-asserted-by":"publisher","DOI":"10.1109\/FOCS.2006.42"},{"key":"ref6","doi-asserted-by":"publisher","DOI":"10.1109\/ITW.2007.4313060"},{"key":"ref5","doi-asserted-by":"publisher","DOI":"10.1109\/FOCS.2007.48"},{"key":"ref8","doi-asserted-by":"publisher","DOI":"10.1109\/FOCS.2008.41"},{"key":"ref7","doi-asserted-by":"publisher","DOI":"10.1109\/TIT.2010.2048502"},{"key":"ref2","doi-asserted-by":"publisher","DOI":"10.1145\/1159913.1159942"},{"key":"ref1","doi-asserted-by":"publisher","DOI":"10.1109\/INFCOM.1998.662940"},{"key":"ref9","doi-asserted-by":"publisher","DOI":"10.1109\/18.850663"}],"event":{"name":"2011 IEEE International Symposium on Information Theory - ISIT","start":{"date-parts":[[2011,7,31]]},"location":"St. Petersburg, Russia","end":{"date-parts":[[2011,8,5]]}},"container-title":["2011 IEEE International Symposium on Information Theory Proceedings"],"original-title":[],"link":[{"URL":"http:\/\/xplorestaging.ieee.org\/ielx5\/6026198\/6033677\/06034286.pdf?arnumber=6034286","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2017,6,20]],"date-time":"2017-06-20T03:35:06Z","timestamp":1497929706000},"score":1,"resource":{"primary":{"URL":"http:\/\/ieeexplore.ieee.org\/document\/6034286\/"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2011,7]]},"references-count":18,"URL":"https:\/\/doi.org\/10.1109\/isit.2011.6034286","relation":{},"subject":[],"published":{"date-parts":[[2011,7]]}}}