{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2022,3,29]],"date-time":"2022-03-29T16:54:12Z","timestamp":1648572852668},"reference-count":40,"publisher":"Institute of Electrical and Electronics Engineers (IEEE)","issue":"8","license":[{"start":{"date-parts":[[2013,8,1]],"date-time":"2013-08-01T00:00:00Z","timestamp":1375315200000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/ieeexplore.ieee.org\/Xplorehelp\/downloads\/license-information\/IEEE.html"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":["IEEE Trans. Inform. Theory"],"published-print":{"date-parts":[[2013,8]]},"DOI":"10.1109\/tit.2013.2257918","type":"journal-article","created":{"date-parts":[[2013,5,2]],"date-time":"2013-05-02T23:41:15Z","timestamp":1367538075000},"page":"5131-5139","source":"Crossref","is-referenced-by-count":0,"title":["Upper Bounds on Matching Families in &lt;formula formulatype=\"inline\"&gt; &lt;tex Notation=\"TeX\"&gt;$\\BBZ_{pq}^{n}$&lt;\/tex&gt;&lt;\/formula&gt;"],"prefix":"10.1109","volume":"59","author":[{"family":"Yeow Meng Chee","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"family":"San Ling","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"family":"Huaxiong Wang","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"family":"Liang Feng Zhang","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"263","reference":[{"key":"ref39","doi-asserted-by":"publisher","DOI":"10.1145\/1250790.1250830"},{"key":"ref38","doi-asserted-by":"publisher","DOI":"10.1109\/CCC.2005.2"},{"key":"ref33","doi-asserted-by":"publisher","DOI":"10.1016\/j.ipl.2005.11.009"},{"key":"ref32","doi-asserted-by":"publisher","DOI":"10.1007\/s004939970007"},{"key":"ref31","article-title":"A note on Yekhanin's locally decodable codes","volume":"14","author":"raghavendra","year":"2007","journal-title":"Electron Colloq Comput Complex"},{"key":"ref30","doi-asserted-by":"publisher","DOI":"10.1145\/195058.195132"},{"key":"ref37","article-title":"New lower bounds for general locally decodable codes","volume":"14","author":"woodruff","year":"2007","journal-title":"Electronic Colloq on Computational Complexity"},{"key":"ref36","first-page":"1424","article-title":"Improved lower bounds for locally decodable codes and private information retrieval","volume":"3580","author":"wehner","year":"2005","journal-title":"Proc 32nd Int Colloq Autom Lang Program"},{"key":"ref35","doi-asserted-by":"publisher","DOI":"10.1109\/CCC.1999.766253"},{"key":"ref34","doi-asserted-by":"publisher","DOI":"10.1007\/3-540-60615-7"},{"key":"ref10","doi-asserted-by":"publisher","DOI":"10.1007\/s00037-011-0017-1"},{"key":"ref40","doi-asserted-by":"publisher","DOI":"10.1561\/0400000030"},{"key":"ref11","doi-asserted-by":"publisher","DOI":"10.1112\/blms\/25.3.231"},{"key":"ref12","doi-asserted-by":"publisher","DOI":"10.1145\/293347.293350"},{"key":"ref13","doi-asserted-by":"publisher","DOI":"10.1109\/CCC.2002.1004354"},{"key":"ref14","doi-asserted-by":"publisher","DOI":"10.1007\/BF02579189"},{"key":"ref15","doi-asserted-by":"publisher","DOI":"10.1109\/FOCS.2010.73"},{"key":"ref16","doi-asserted-by":"publisher","DOI":"10.1145\/1060590.1060678"},{"key":"ref17","doi-asserted-by":"publisher","DOI":"10.1145\/1536414.1536422"},{"key":"ref18","doi-asserted-by":"publisher","DOI":"10.1093\/qmath\/12.1.313"},{"key":"ref19","doi-asserted-by":"publisher","DOI":"10.1109\/CCC.2002.1004353"},{"key":"ref28","first-page":"207","article-title":"Efficient checking of computations","volume":"415","author":"lipton","year":"1990","journal-title":"Proc 7th Annu Symp Theor Aspects Comput Sci"},{"key":"ref4","doi-asserted-by":"crossref","first-page":"39","DOI":"10.1006\/jcta.2000.3149","article-title":"Set systems with restricted intersections modulo prime powers","volume":"95","author":"alon","year":"2001","journal-title":"J Combin Theory A"},{"key":"ref27","doi-asserted-by":"publisher","DOI":"10.1017\/S0963548302005242"},{"key":"ref3","author":"babai","year":"1998","journal-title":"Linear Algebra Methods in Combinatorics"},{"key":"ref6","doi-asserted-by":"publisher","DOI":"10.1016\/j.jcss.2005.03.002"},{"key":"ref29","first-page":"39","article-title":"Optimal lower bounds for 2-query locally decodable linear codes","volume":"2483","author":"obata","year":"2002","journal-title":"Proc 6th Int Workshop Random Approx Tech"},{"key":"ref5","first-page":"37","article-title":"Hiding instances in multioracle queries","volume":"415","author":"beaver","year":"1990","journal-title":"Proc 7th Annu Symp Theor Aspects Comput Sci"},{"key":"ref8","article-title":"A note on amplifying the error-tolerance of locally decodable codes","volume":"17","author":"ben-aroya","year":"2010","journal-title":"Electronic Colloq on Computational Complexity"},{"key":"ref7","doi-asserted-by":"crossref","first-page":"261","DOI":"10.1109\/SFCS.2002.1181949","article-title":"Breaking the <formula formulatype=\"inline\"> <tex Notation=\"TeX\">$O(n^{1\/(2k-1)})$<\/tex><\/formula> barrier for information-theoretic private information retrieval","author":"beimel","year":"2002","journal-title":"Proc 43rd Annu IEEE Symp Found Comput Sci"},{"key":"ref2","first-page":"21","article-title":"Checking computations in polylogarithmic time","author":"babai","year":"2001","journal-title":"Proc 33rd ACM Symp Theory Comput"},{"key":"ref9","article-title":"New lower bounds for matching vector codes","volume":"19","author":"bhowmick","year":"2012","journal-title":"Electronic Colloq on Computational Complexity"},{"key":"ref1","doi-asserted-by":"publisher","DOI":"10.1007\/BF02579382"},{"key":"ref20","article-title":"A note on Efremenko's locally decodable codes","volume":"16","author":"gopalan","year":"2009","journal-title":"Electronic Colloq on Computational Complexity"},{"key":"ref22","author":"itoh","year":"2008"},{"key":"ref21","doi-asserted-by":"publisher","DOI":"10.1007\/s004930070032"},{"key":"ref24","doi-asserted-by":"publisher","DOI":"10.1145\/335305.335315"},{"key":"ref23","doi-asserted-by":"publisher","DOI":"10.1587\/transinf.E93.D.263"},{"key":"ref26","doi-asserted-by":"publisher","DOI":"10.1145\/780559.780560"},{"key":"ref25","doi-asserted-by":"publisher","DOI":"10.1137\/070696519"}],"container-title":["IEEE Transactions on Information Theory"],"original-title":[],"link":[{"URL":"http:\/\/xplorestaging.ieee.org\/ielx7\/18\/6557006\/06512552.pdf?arnumber=6512552","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2021,11,29]],"date-time":"2021-11-29T20:47:46Z","timestamp":1638218866000},"score":1,"resource":{"primary":{"URL":"http:\/\/ieeexplore.ieee.org\/document\/6512552\/"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2013,8]]},"references-count":40,"journal-issue":{"issue":"8"},"URL":"https:\/\/doi.org\/10.1109\/tit.2013.2257918","relation":{},"ISSN":["0018-9448","1557-9654"],"issn-type":[{"value":"0018-9448","type":"print"},{"value":"1557-9654","type":"electronic"}],"subject":[],"published":{"date-parts":[[2013,8]]}}}