{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2024,8,20]],"date-time":"2024-08-20T06:34:30Z","timestamp":1724135670469},"reference-count":14,"publisher":"IEEE","content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2018,11]]},"DOI":"10.1109\/itw.2018.8613527","type":"proceedings-article","created":{"date-parts":[[2019,1,18]],"date-time":"2019-01-18T00:39:34Z","timestamp":1547771974000},"source":"Crossref","is-referenced-by-count":32,"title":["Coded Caching via Line Graphs of Bipartite Graphs"],"prefix":"10.1109","author":[{"given":"Prasad","family":"Krishnan","sequence":"first","affiliation":[]}],"member":"263","reference":[{"key":"ref10","doi-asserted-by":"publisher","DOI":"10.1109\/TIT.2018.2800059"},{"key":"ref11","author":"cheng","year":"2017","journal-title":"Coded Caching Schemes with Low Rate and Subpacketizations"},{"key":"ref12","author":"cheng","year":"2017","journal-title":"Coded caching schemes for flexible memory sizes"},{"key":"ref13","author":"diestel","year":"2000","journal-title":"Graph Theory"},{"key":"ref14","author":"hirschfeld","year":"1998","journal-title":"Projective Geometries over Finite Fields"},{"key":"ref4","doi-asserted-by":"publisher","DOI":"10.1109\/TNET.2015.2394482"},{"key":"ref3","doi-asserted-by":"publisher","DOI":"10.1109\/TIT.2015.2504556"},{"key":"ref6","doi-asserted-by":"publisher","DOI":"10.1109\/LCOMM.2017.2765629"},{"key":"ref5","doi-asserted-by":"publisher","DOI":"10.1109\/TIT.2016.2599110"},{"key":"ref8","author":"shangguan","year":"2016","journal-title":"Centralized coded caching schemes A hypergraph theoretical approach"},{"key":"ref7","doi-asserted-by":"publisher","DOI":"10.1109\/TIT.2017.2725272"},{"key":"ref2","doi-asserted-by":"publisher","DOI":"10.1109\/TIT.2014.2306938"},{"key":"ref1","article-title":"Coded Caching via Line Graphs of Bipartite Graphs","author":"krishnan","year":"0","journal-title":"Available on ArXiv"},{"key":"ref9","first-page":"1237","article-title":"Coded Caching with Linear Subpacketization is Possible using Ruzsa-Szemredi Graphs","author":"shanmugam","year":"0","journal-title":"IEEE ISIT 2017"}],"event":{"name":"2018 IEEE Information Theory Workshop (ITW)","location":"Guangzhou","start":{"date-parts":[[2018,11,25]]},"end":{"date-parts":[[2018,11,29]]}},"container-title":["2018 IEEE Information Theory Workshop (ITW)"],"original-title":[],"link":[{"URL":"http:\/\/xplorestaging.ieee.org\/ielx7\/8598908\/8613300\/08613527.pdf?arnumber=8613527","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2022,1,26]],"date-time":"2022-01-26T21:32:45Z","timestamp":1643232765000},"score":1,"resource":{"primary":{"URL":"https:\/\/ieeexplore.ieee.org\/document\/8613527\/"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2018,11]]},"references-count":14,"URL":"https:\/\/doi.org\/10.1109\/itw.2018.8613527","relation":{},"subject":[],"published":{"date-parts":[[2018,11]]}}}