{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2024,10,30]],"date-time":"2024-10-30T09:04:38Z","timestamp":1730279078635,"version":"3.28.0"},"reference-count":31,"publisher":"IEEE","content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2018,11]]},"DOI":"10.1109\/itw.2018.8613518","type":"proceedings-article","created":{"date-parts":[[2019,1,17]],"date-time":"2019-01-17T19:39:34Z","timestamp":1547753974000},"page":"1-5","source":"Crossref","is-referenced-by-count":5,"title":["Asynchronous Batch and PIR Codes from Hypergraphs"],"prefix":"10.1109","author":[{"given":"Ago-Erik","family":"Riet","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Vitaly","family":"Skachek","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Eldho K.","family":"Thomas","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"263","reference":[{"key":"ref31","doi-asserted-by":"publisher","DOI":"10.1109\/ISIT.2016.7541487"},{"key":"ref30","doi-asserted-by":"publisher","DOI":"10.1016\/0097-3165(75)90067-9"},{"key":"ref10","doi-asserted-by":"publisher","DOI":"10.1007\/s00493-016-3326-9"},{"key":"ref11","doi-asserted-by":"publisher","DOI":"10.1145\/1007352.1007396"},{"key":"ref12","doi-asserted-by":"publisher","DOI":"10.1109\/TIT.1962.1057714"},{"key":"ref13","article-title":"The existence of designs","author":"keevash","year":"2018","journal-title":"arXiv 1401 3665"},{"key":"ref14","doi-asserted-by":"crossref","first-page":"84","DOI":"10.1007\/3-540-45878-6_3","article-title":"The regularity lemma and its applications in graph theory","author":"komlos","year":"2002","journal-title":"Theoretical Aspects of Computer Science"},{"key":"ref15","article-title":"Lengthening and extending bniary private information retrieval codes","author":"lin","year":"2018","journal-title":"Proc Intern Zurich Seminar on Inform and Commun"},{"key":"ref16","article-title":"Linear batch codes","author":"lipmaa","year":"2014","journal-title":"Proc 4th Int Castle Meeting on Coding Theory and Appl Portugal"},{"key":"ref17","first-page":"60","article-title":"Problem 28 (Solution by H. Gouwentak, W. Mantel, J. Teixeira de Mattes, F. Schuh and W. A. Wythoff)","volume":"10","author":"mantel","year":"1907","journal-title":"Wiskundige Opgaven"},{"key":"ref18","first-page":"371","article-title":"Coverings and packings","author":"mills","year":"1992","journal-title":"Contemporary Design Theory"},{"key":"ref19","article-title":"Lower bound on the redundancy of PIR codes","author":"rao","year":"2016","journal-title":"arXiv 1605 01869"},{"key":"ref28","doi-asserted-by":"publisher","DOI":"10.1016\/0097-3165(72)90028-3"},{"key":"ref4","first-page":"55","article-title":"Some extremal problems on r-graphs","author":"brown","year":"1973","journal-title":"New Directions in the Theory of Graphs 3rd Ann Arbor Conference on Graph Theory Academic Press"},{"key":"ref27","doi-asserted-by":"publisher","DOI":"10.1109\/ISIT.2015.7282532"},{"key":"ref3","article-title":"PIR array codes with optimal PIR rates","author":"blackburn","year":"2016","journal-title":"arXiv 1609 07070"},{"key":"ref6","doi-asserted-by":"publisher","DOI":"10.1109\/JPROC.2010.2096170"},{"key":"ref29","doi-asserted-by":"publisher","DOI":"10.1016\/0097-3165(72)90029-5"},{"key":"ref5","doi-asserted-by":"crossref","first-page":"221","DOI":"10.1007\/BF02018585","article-title":"On the existence of triangulated spheres in 3-graphs and related problems","volume":"3","author":"brown","year":"1973","journal-title":"Periodica Mathem Hungarica"},{"key":"ref8","article-title":"PIR with low storage overhead: coding instead of replication","author":"fazeli","year":"2015","journal-title":"arXiv 1505 06241"},{"key":"ref7","doi-asserted-by":"publisher","DOI":"10.1007\/BF01788085"},{"key":"ref2","doi-asserted-by":"publisher","DOI":"10.1073\/pnas.32.12.331"},{"key":"ref9","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-642-39286-3_7"},{"key":"ref1","doi-asserted-by":"publisher","DOI":"10.1007\/s00493-006-0035-9"},{"key":"ref20","doi-asserted-by":"publisher","DOI":"10.1109\/TIT.2016.2524007"},{"key":"ref22","first-page":"939","article-title":"Triple systems with no six points carrying three triangles","author":"ruzsa","year":"1978","journal-title":"Colloq Math Soc J Bolyai"},{"key":"ref21","doi-asserted-by":"publisher","DOI":"10.1073\/pnas.0502771102"},{"key":"ref24","first-page":"436","article-title":"On an extremal problem in graph theory","volume":"48","author":"turan","year":"1941","journal-title":"Matematikai Es Fizikai Lapok"},{"key":"ref23","first-page":"427","article-title":"Batch and PIR codes and their connections to locally-repairable codes","author":"skachek","year":"2018"},{"key":"ref26","doi-asserted-by":"publisher","DOI":"10.1109\/ISIT.2016.7541488"},{"key":"ref25","doi-asserted-by":"publisher","DOI":"10.1109\/ISIT.2017.8007009"}],"event":{"name":"2018 IEEE Information Theory Workshop (ITW)","start":{"date-parts":[[2018,11,25]]},"location":"Guangzhou","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\/08613518.pdf?arnumber=8613518","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2022,1,26]],"date-time":"2022-01-26T17:18:15Z","timestamp":1643217495000},"score":1,"resource":{"primary":{"URL":"https:\/\/ieeexplore.ieee.org\/document\/8613518\/"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2018,11]]},"references-count":31,"URL":"https:\/\/doi.org\/10.1109\/itw.2018.8613518","relation":{},"subject":[],"published":{"date-parts":[[2018,11]]}}}