{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2024,10,23]],"date-time":"2024-10-23T00:02:17Z","timestamp":1729641737227,"version":"3.28.0"},"reference-count":20,"publisher":"IEEE","content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2014,6]]},"DOI":"10.1109\/isit.2014.6874880","type":"proceedings-article","created":{"date-parts":[[2014,8,19]],"date-time":"2014-08-19T21:50:30Z","timestamp":1408485030000},"page":"486-490","source":"Crossref","is-referenced-by-count":2,"title":["Linear index coding and representable discrete polymatroids"],"prefix":"10.1109","author":[{"given":"Vijayvaradharaj T.","family":"Muralidharan","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":"19","doi-asserted-by":"publisher","DOI":"10.1016\/S0012-365X(99)00004-7"},{"journal-title":"Matroid Theory","year":"1993","author":"oxley","key":"17"},{"key":"18","doi-asserted-by":"publisher","DOI":"10.1023\/A:1008244215660"},{"key":"15","first-page":"232","article-title":"On representable matroids and ideal secret sharing","author":"hsu","year":"2010","journal-title":"IACR Cryptology"},{"journal-title":"Matroid Theory","year":"1976","author":"welsh","key":"16"},{"key":"13","first-page":"89","author":"vladoiu","year":"2006","journal-title":"Discrete Polymatroids"},{"key":"14","first-page":"448","article-title":"Ideal multipartite secret sharing schemes","author":"farras","year":"2007","journal-title":"Advances in Cryptology-Eurocrypt"},{"key":"11","article-title":"A construction of matroidal error correcting codes","author":"prasad","year":"2012","journal-title":"Proc Int Symp Information Theory and Its Applications"},{"key":"12","doi-asserted-by":"crossref","first-page":"239","DOI":"10.1023\/A:1021852421716","article-title":"Discrete polymatroids","volume":"16","author":"herzog","year":"2002","journal-title":"J Algebraic Combinatorics"},{"key":"3","doi-asserted-by":"publisher","DOI":"10.1109\/TNET.2003.818197"},{"journal-title":"Linear Network Coding Linear Index Coding and Representable Discrete Polymatroids","year":"2013","author":"muralidharan","key":"20"},{"key":"2","doi-asserted-by":"publisher","DOI":"10.1109\/TIT.2002.807285"},{"key":"1","doi-asserted-by":"publisher","DOI":"10.1109\/18.850663"},{"key":"10","doi-asserted-by":"publisher","DOI":"10.1109\/ISIT.2012.6283512"},{"key":"7","doi-asserted-by":"publisher","DOI":"10.1109\/TIT.2010.2048502"},{"key":"6","doi-asserted-by":"publisher","DOI":"10.1109\/INFOCOM.2008.4544612"},{"key":"5","doi-asserted-by":"publisher","DOI":"10.1109\/FOCS.2006.42"},{"key":"4","doi-asserted-by":"publisher","DOI":"10.1109\/TIT.2006.881746"},{"key":"9","doi-asserted-by":"publisher","DOI":"10.1109\/ISTC.2010.5613864"},{"key":"8","doi-asserted-by":"publisher","DOI":"10.1109\/TIT.2007.896862"}],"event":{"name":"2014 IEEE International Symposium on Information Theory (ISIT)","start":{"date-parts":[[2014,6,29]]},"location":"Honolulu, HI, USA","end":{"date-parts":[[2014,7,4]]}},"container-title":["2014 IEEE International Symposium on Information Theory"],"original-title":[],"link":[{"URL":"http:\/\/xplorestaging.ieee.org\/ielx7\/6867217\/6874773\/06874880.pdf?arnumber=6874880","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2020,10,14]],"date-time":"2020-10-14T15:04:29Z","timestamp":1602687869000},"score":1,"resource":{"primary":{"URL":"https:\/\/ieeexplore.ieee.org\/document\/6874880"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2014,6]]},"references-count":20,"URL":"https:\/\/doi.org\/10.1109\/isit.2014.6874880","relation":{},"subject":[],"published":{"date-parts":[[2014,6]]}}}