{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,3,13]],"date-time":"2026-03-13T05:01:12Z","timestamp":1773378072506,"version":"3.50.1"},"reference-count":14,"publisher":"IEEE","license":[{"start":{"date-parts":[[2022,6,26]],"date-time":"2022-06-26T00:00:00Z","timestamp":1656201600000},"content-version":"stm-asf","delay-in-days":0,"URL":"https:\/\/doi.org\/10.15223\/policy-029"},{"start":{"date-parts":[[2022,6,26]],"date-time":"2022-06-26T00:00:00Z","timestamp":1656201600000},"content-version":"stm-asf","delay-in-days":0,"URL":"https:\/\/doi.org\/10.15223\/policy-037"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2022,6,26]]},"DOI":"10.1109\/isit50566.2022.9834487","type":"proceedings-article","created":{"date-parts":[[2022,8,3]],"date-time":"2022-08-03T15:34:22Z","timestamp":1659540862000},"page":"975-979","source":"Crossref","is-referenced-by-count":3,"title":["Lower bounds on the redundancy of linear codes with disjoint repair groups"],"prefix":"10.1109","author":[{"given":"Sankeerth Rao","family":"Karingula","sequence":"first","affiliation":[{"name":"University of California,San Diego"}]},{"given":"Alexander","family":"Vardy","sequence":"additional","affiliation":[{"name":"University of California,San Diego"}]},{"given":"Mary","family":"Wootters","sequence":"additional","affiliation":[{"name":"University of California,San Diego"}]}],"member":"263","reference":[{"key":"ref10","article-title":"Lower bound on the redundancy of pir codes","author":"rao","year":"2016","journal-title":"arXiv preprint arXiv 1605 01584"},{"key":"ref11","doi-asserted-by":"crossref","first-page":"427","DOI":"10.1007\/978-3-319-70293-3_16","author":"skachek","year":"2018","journal-title":"Network Coding and Subspace Designs"},{"key":"ref12","doi-asserted-by":"publisher","DOI":"10.1109\/ISIT.2014.6874921"},{"key":"ref13","doi-asserted-by":"publisher","DOI":"10.1007\/s11390-012-1254-8"},{"key":"ref14","article-title":"Linear codes with disjoint re-pair groups. Unpublished manuscript","author":"wootters","year":"2016"},{"key":"ref4","doi-asserted-by":"publisher","DOI":"10.1109\/ISIT.2015.7282977"},{"key":"ref3","doi-asserted-by":"publisher","DOI":"10.1109\/ISIT.2017.8007011"},{"key":"ref6","doi-asserted-by":"publisher","DOI":"10.1109\/ISIT45174.2021.9518246"},{"key":"ref5","article-title":"Locality via partially lifted codes","author":"frank-fischer","year":"2017","journal-title":"CoRR abs\/1704 08627"},{"key":"ref8","doi-asserted-by":"publisher","DOI":"10.1109\/TIT.2020.3034962"},{"key":"ref7","doi-asserted-by":"publisher","DOI":"10.1109\/TIT.2021.3116520"},{"key":"ref2","article-title":"Combinatorial lower bounds for 3-query ldcs","author":"bhattacharyya","year":"2020","journal-title":"11th Innovations in Theoretical Computer Science Conference (ITCS 2020)"},{"key":"ref1","doi-asserted-by":"publisher","DOI":"10.1109\/TIT.2018.2852294"},{"key":"ref9","article-title":"Improved batch code lower bounds","author":"li","year":"2021","journal-title":"arXiv preprint arXiv 2106 01111"}],"event":{"name":"2022 IEEE International Symposium on Information Theory (ISIT)","location":"Espoo, Finland","start":{"date-parts":[[2022,6,26]]},"end":{"date-parts":[[2022,7,1]]}},"container-title":["2022 IEEE International Symposium on Information Theory (ISIT)"],"original-title":[],"link":[{"URL":"http:\/\/xplorestaging.ieee.org\/ielx7\/9834325\/9834269\/09834487.pdf?arnumber=9834487","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2026,3,12]],"date-time":"2026-03-12T20:36:09Z","timestamp":1773347769000},"score":1,"resource":{"primary":{"URL":"https:\/\/ieeexplore.ieee.org\/document\/9834487\/"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2022,6,26]]},"references-count":14,"URL":"https:\/\/doi.org\/10.1109\/isit50566.2022.9834487","relation":{},"subject":[],"published":{"date-parts":[[2022,6,26]]}}}