{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,3,13]],"date-time":"2026-03-13T05:00:56Z","timestamp":1773378056833,"version":"3.50.1"},"reference-count":37,"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.9834690","type":"proceedings-article","created":{"date-parts":[[2022,8,3]],"date-time":"2022-08-03T15:34:22Z","timestamp":1659540862000},"page":"3268-3273","source":"Crossref","is-referenced-by-count":0,"title":["Update and Repair Efficient Storage Codes with Availability via Finite Projective Planes"],"prefix":"10.1109","author":[{"given":"Junming","family":"Ke","sequence":"first","affiliation":[{"name":"University of Tartu,Estonia"}]},{"given":"Ago-Erik","family":"Riet","sequence":"additional","affiliation":[{"name":"University of Tartu,Estonia"}]}],"member":"263","reference":[{"key":"ref33","doi-asserted-by":"crossref","first-page":"427","DOI":"10.1007\/978-3-319-70293-3_16","article-title":"Batch and pir codes and their connections to locally repairable codes","author":"skachek","year":"2018","journal-title":"Network Coding and Subspace Designs"},{"key":"ref32","doi-asserted-by":"publisher","DOI":"10.2307\/1990067"},{"key":"ref31","doi-asserted-by":"publisher","DOI":"10.1109\/TIT.2018.2876421"},{"key":"ref30","doi-asserted-by":"publisher","DOI":"10.1109\/TIT.2005.864441"},{"key":"ref37","doi-asserted-by":"publisher","DOI":"10.1109\/TIT.2018.2873140"},{"key":"ref36","article-title":"Intertwined results on linear codes and Galois geometries","author":"vandendriessche","year":"2014","journal-title":"PhD thesis"},{"key":"ref35","doi-asserted-by":"publisher","DOI":"10.1016\/j.disc.2011.07.010"},{"key":"ref34","doi-asserted-by":"publisher","DOI":"10.1109\/GLOCOM.2016.7841631"},{"key":"ref10","doi-asserted-by":"publisher","DOI":"10.1109\/ICCNC.2013.6504196"},{"key":"ref11","year":"2017","journal-title":"Large gaps in singer planar difference sets? MathOverflow"},{"key":"ref12","doi-asserted-by":"publisher","DOI":"10.1109\/ISIT44484.2020.9174027"},{"key":"ref13","doi-asserted-by":"publisher","DOI":"10.1109\/18.959255"},{"key":"ref14","doi-asserted-by":"publisher","DOI":"10.1090\/conm\/523\/10326"},{"key":"ref15","doi-asserted-by":"publisher","DOI":"10.1109\/TIT.2020.2977638"},{"key":"ref16","doi-asserted-by":"crossref","DOI":"10.1093\/oso\/9780198570431.001.0001","author":"matou\u0161ek","year":"2008","journal-title":"Invitation to Discrete Mathematics"},{"key":"ref17","doi-asserted-by":"publisher","DOI":"10.1109\/JSAC.2014.140517"},{"key":"ref18","article-title":"Empirical Study of Asynchronous Batch Codes","author":"mikelsaar","year":"2019","journal-title":"Master’s thesis"},{"key":"ref19","doi-asserted-by":"publisher","DOI":"10.1007\/BF00123956"},{"key":"ref28","doi-asserted-by":"publisher","DOI":"10.1109\/ISIT.2011.6033782"},{"key":"ref4","article-title":"High-rate storage codes on triangle-free graphs","author":"barg","year":"2021"},{"key":"ref27","doi-asserted-by":"publisher","DOI":"10.1109\/ISIT.2015.7282698"},{"key":"ref3","doi-asserted-by":"publisher","DOI":"10.1090\/S0002-9947-2011-05552-2"},{"key":"ref6","first-page":"39","article-title":"On sets of points in pg (2, q) without tangents","volume":"201","author":"blokhuis","year":"1991","journal-title":"Mitt Math Sem Giessen"},{"key":"ref29","first-page":"1426","article-title":"Error floors of ldpc codes","volume":"41","author":"richardson","year":"2003","journal-title":"Proceedings of the Annual Allerton Conference on Communication Control and Computing"},{"key":"ref5","article-title":"Moderate density parity-check codes from projective bundles","author":"bariffi","year":"2021"},{"key":"ref8","doi-asserted-by":"publisher","DOI":"10.1109\/TIT.2002.1003839"},{"key":"ref7","doi-asserted-by":"publisher","DOI":"10.1109\/TIT.2020.3031207"},{"key":"ref2","author":"assmus","year":"1994","journal-title":"Designs and their Codes"},{"key":"ref9","article-title":"Sharp threshold rates for random codes","author":"guruswami","year":"2020"},{"key":"ref1","doi-asserted-by":"publisher","DOI":"10.1109\/GLOCOM.2008.ECP.217"},{"key":"ref20","first-page":"3p","article-title":"Small stopping sets in finite projective planes of order q","volume":"4","author":"napolitano","year":"2021","journal-title":"Art Discrete Appl Math"},{"key":"ref22","doi-asserted-by":"publisher","DOI":"10.1109\/ITW.2011.6089443"},{"key":"ref21","doi-asserted-by":"publisher","DOI":"10.1007\/s10623-019-00647-4"},{"key":"ref24","doi-asserted-by":"publisher","DOI":"10.1109\/TIT.2020.3013603"},{"key":"ref23","doi-asserted-by":"publisher","DOI":"10.1109\/ISIT.2013.6620355"},{"key":"ref26","article-title":"A survey on trapping sets and stopping sets","author":"price","year":"2017"},{"key":"ref25","author":"pott","year":"2006","journal-title":"Finite Geometry and Character Theory"}],"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\/09834690.pdf?arnumber=9834690","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2026,3,12]],"date-time":"2026-03-12T20:36:04Z","timestamp":1773347764000},"score":1,"resource":{"primary":{"URL":"https:\/\/ieeexplore.ieee.org\/document\/9834690\/"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2022,6,26]]},"references-count":37,"URL":"https:\/\/doi.org\/10.1109\/isit50566.2022.9834690","relation":{},"subject":[],"published":{"date-parts":[[2022,6,26]]}}}