{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,7,17]],"date-time":"2026-07-17T15:11:01Z","timestamp":1784301061855,"version":"3.55.0"},"reference-count":33,"publisher":"Springer Science and Business Media LLC","issue":"5","license":[{"start":{"date-parts":[[2026,5,1]],"date-time":"2026-05-01T00:00:00Z","timestamp":1777593600000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.springernature.com\/gp\/researchers\/text-and-data-mining"},{"start":{"date-parts":[[2026,5,1]],"date-time":"2026-05-01T00:00:00Z","timestamp":1777593600000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/www.springernature.com\/gp\/researchers\/text-and-data-mining"}],"content-domain":{"domain":["link.springer.com"],"crossmark-restriction":false},"short-container-title":["Des. Codes Cryptogr."],"published-print":{"date-parts":[[2026,5]]},"DOI":"10.1007\/s10623-026-01857-3","type":"journal-article","created":{"date-parts":[[2026,5,16]],"date-time":"2026-05-16T04:27:24Z","timestamp":1778905644000},"update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":1,"title":["The geometry of codes for random access in DNA storage"],"prefix":"10.1007","volume":"94","author":[{"given":"Anina","family":"Gruica","sequence":"first","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]},{"given":"Maria","family":"Montanucci","sequence":"additional","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]},{"given":"Ferdinando","family":"Zullo","sequence":"additional","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]}],"member":"297","published-online":{"date-parts":[[2026,5,16]]},"reference":[{"key":"1857_CR1","doi-asserted-by":"crossref","unstructured":"Abraham H., Gabrys R., Yaakobi E.: Covering all bases: the next inning in DNA sequencing efficiency. arXiv preprint (2024).","DOI":"10.1109\/ISIT57864.2024.10619092"},{"issue":"10","key":"1857_CR2","doi-asserted-by":"publisher","first-page":"1229","DOI":"10.1038\/s41587-019-0240-x","volume":"37","author":"L Anavy","year":"2019","unstructured":"Anavy L., Vaknin I., Atar O., Amit R., Yakhini Z.: Data storage in DNA with fewer synthesis cycles using composite DNA letters. Nat. Biotechnol. 37(10), 1229\u20131236 (2019).","journal-title":"Nat. Biotechnol."},{"key":"1857_CR3","unstructured":"Bar-Lev D., Orr I., Sabary O., Etzion T., Yaakobi E.: Deep DNA storage: scalable and robust DNA storage via coding theory and deep learning. arXiv preprint (2021). arXiv:2109.00031."},{"key":"1857_CR4","doi-asserted-by":"crossref","unstructured":"Bar-Lev D., Sabary O., Gabrys, R., Yaakobi, E.: Cover your bases: how to minimize the sequencing coverage in DNA storage systems. arXiv preprint (2023). arXiv:2305.05656.","DOI":"10.1109\/ISIT54713.2023.10206882"},{"key":"1857_CR5","doi-asserted-by":"publisher","first-page":"1011","DOI":"10.1016\/j.procs.2016.05.398","volume":"80","author":"M Blawat","year":"2016","unstructured":"Blawat M., Gaedke K., Huetter I., Chen X.-M., Turczyk B., Inverso S., Pruitt B.W., Church G.M.: Forward error correction for DNA data storage. Procedia Comput. Sci. 80, 1011\u20131022 (2016).","journal-title":"Procedia Comput. Sci."},{"key":"1857_CR6","doi-asserted-by":"publisher","first-page":"111","DOI":"10.1007\/BF01305953","volume":"14","author":"A Blokhuis","year":"1994","unstructured":"Blokhuis A.: On the size of a blocking set in PG(2, p). Combinatorica 14, 111\u2013114 (1994).","journal-title":"Combinatorica"},{"key":"1857_CR7","doi-asserted-by":"crossref","unstructured":"Bornholt J., Lopez R., Carmean D.M., Ceze L., Seelig G., Strauss K.: A DNA-based archival storage system. In: Proceedings of the Twenty-First International Conference on Architectural Support for Programming Languages and Operating Systems, pp. 637\u2013649 (2016).","DOI":"10.1145\/2872362.2872397"},{"key":"1857_CR8","unstructured":"Boruchovsky A., Elishco O., Gabrys R., Gruica A., Tamo I., Yaakobi E.: Making it to first: the random access problem in DNA storage. arXiv preprint (2025). arXiv:2501.12274."},{"key":"1857_CR9","unstructured":"Cameron P. J.: Four lectures on projective geometry. In: Finite Geometries, pp. 27\u201363. CRC Press, Boca Raton (1985)."},{"key":"1857_CR10","doi-asserted-by":"crossref","unstructured":"Chandak S., Tatwawadi K., Lau B., Mardia J., Kubit M., Neu J., Griffin P., Wootters M., Weissman T., Ji H.: Improved read\/write cost tradeoff in DNA-based data storage using LDPC codes. In: 2019 57th Annual Allerton Conference on Communication, Control, and Computing (Allerton), pp. 147\u2013156. IEEE (2019).","DOI":"10.1109\/ALLERTON.2019.8919890"},{"key":"1857_CR11","doi-asserted-by":"crossref","unstructured":"Cohen, T., Yaakobi, E.: Optimizing the decoding probability and coverage ratio of composite DNA. In: 2024 IEEE International Symposium on Information Theory (ISIT), pp. 1949\u20131954. IEEE (2024).","DOI":"10.1109\/ISIT57864.2024.10619348"},{"key":"1857_CR12","volume-title":"Asymptotic Methods in Analysis","author":"NG De Bruijn","year":"1981","unstructured":"De Bruijn N.G.: Asymptotic Methods in Analysis, vol. 4. Courier Corporation, North Chelmsford (1981)."},{"issue":"1","key":"1857_CR13","doi-asserted-by":"publisher","first-page":"81","DOI":"10.1007\/s10623-012-9709-z","volume":"68","author":"U Dempwolff","year":"2013","unstructured":"Dempwolff U.: More translation planes and semifields from Dembowski\u2013Ostrom polynomials. Des. Codes Cryptogr. 68(1), 81\u2013103 (2013).","journal-title":"Des. Codes Cryptogr."},{"key":"1857_CR14","unstructured":"DNA Data Storage Alliance: Preserving our digital legacy: an introduction to DNA data storage (2021). https:\/\/dnastoragealliance.org\/dev\/wp-content\/uploads\/2021\/06\/DNA-Data-Storage-Alliance-An-Introduction-to-DNAData-Storage.pdf."},{"issue":"1","key":"1857_CR15","first-page":"215","volume":"6","author":"P Erd\u0151s","year":"1961","unstructured":"Erd\u0151s P., R\u00e9nyi A.: On a classical problem of probability theory. Magyar Tud. Akad. Mat. Kutat\u00f3 Int. K\u00f6zl 6(1), 215\u2013220 (1961).","journal-title":"Magyar Tud. Akad. Mat. Kutat\u00f3 Int. K\u00f6zl"},{"key":"1857_CR16","volume-title":"An Introduction to Probability Theory and Its Applications","author":"W Felleb","year":"1968","unstructured":"Felleb W.: An Introduction to Probability Theory and Its Applications, vol. 1. IWiley, New York (1968)."},{"issue":"3","key":"1857_CR17","doi-asserted-by":"publisher","first-page":"207","DOI":"10.1016\/0166-218X(92)90177-C","volume":"39","author":"P Flajolet","year":"1992","unstructured":"Flajolet P., Gardy D., Thimonier L.: Birthday paradox, coupon collectors, caching algorithms and self-organizing search. Discret. Appl. Math. 39(3), 207\u2013229 (1992).","journal-title":"Discret. Appl. Math."},{"key":"1857_CR18","unstructured":"Graham R.L., Knuth D.E., Patashnik O.: Concrete Mathematics: A Foundation for Computer Science, vol. 1, 2nd\u00a0ed. Addison-Wesley Professional, Reading (1994)."},{"key":"1857_CR19","doi-asserted-by":"crossref","unstructured":"Gruica A., Bar-Lev D., Ravagnani A., Yaakobi E.: A combinatorial perspective on random access efficiency for DNA storage. arXiv preprint (2024). .arXiv:2401.15722","DOI":"10.1109\/ISIT57864.2024.10619151"},{"issue":"1","key":"1857_CR20","doi-asserted-by":"publisher","first-page":"9663","DOI":"10.1038\/s41598-019-45832-6","volume":"9","author":"R Heckel","year":"2019","unstructured":"Heckel R., Mikutis G., Grass R.N.: A characterization of the DNA data storage channel. Sci. Rep. 9(1), 9663 (2019).","journal-title":"Sci. Rep."},{"key":"1857_CR21","doi-asserted-by":"publisher","DOI":"10.1093\/oso\/9780198502951.001.0001","volume-title":"Projective Geometries over Finite Fields","author":"J Hirschfeld","year":"1998","unstructured":"Hirschfeld J.: Projective Geometries over Finite Fields. Oxford University Press, Oxford (1998)."},{"key":"1857_CR22","unstructured":"Markowitz, D.: Biology is all you need. In: The International Conference for High Performance Computing, Networking, Storage, and Analysis (2023)."},{"issue":"1","key":"1857_CR23","doi-asserted-by":"publisher","first-page":"58","DOI":"10.2307\/2308930","volume":"67","author":"DJ Newman","year":"1960","unstructured":"Newman D.J.: The double dixie cup problem. Am. Math. Mon. 67(1), 58\u201361 (1960).","journal-title":"Am. Math. Mon."},{"issue":"3","key":"1857_CR24","doi-asserted-by":"publisher","first-page":"242","DOI":"10.1038\/nbt.4079","volume":"36","author":"L Organick","year":"2018","unstructured":"Organick L., Ang S.D., Chen Y.-J., Lopez R., Yekhanin S., Makarychev K., Racz M.Z., Kamath G., Gopalan P., Nguyen B., et al.: Random access in large-scale DNA data storage. Nat. Biotechnol. 36(3), 242\u2013248 (2018).","journal-title":"Nat. Biotechnol."},{"key":"1857_CR25","doi-asserted-by":"publisher","DOI":"10.1101\/2024.01.10.574966","author":"I Preuss","year":"2024","unstructured":"Preuss I., Galili B., Yakhini Z., Anavy L.: Sequencing coverage analysis for combinatorial DNA-based storage systems. bioRxiv (2024). https:\/\/doi.org\/10.1101\/2024.01.10.574966.","journal-title":"bioRxiv"},{"key":"1857_CR26","doi-asserted-by":"publisher","DOI":"10.1101\/2021.08.01.454622","author":"I Preuss","year":"2021","unstructured":"Preuss I., Rosenberg M., Yakhini Z., Anavy L.: Efficient DNA-based data storage using Shortmer combinatorial encoding. bioRxiv (2021). https:\/\/doi.org\/10.1101\/2021.08.01.454622.","journal-title":"bioRxiv"},{"key":"1857_CR27","unstructured":"Rydning J.: Worldwide idc global datasphere forecast, 2022\u20132026: enterprise organizations driving most of the data growth. Technical Report (2022)."},{"issue":"1","key":"1857_CR28","doi-asserted-by":"publisher","first-page":"1","DOI":"10.1561\/0100000117","volume":"19","author":"I Shomorony","year":"2022","unstructured":"Shomorony I., Heckel R., et al.: Information-theoretic foundations of DNA data storage. Found. Trends Commun. Inf. Theory 19(1), 1\u2013106 (2022).","journal-title":"Found. Trends Commun. Inf. Theory"},{"key":"1857_CR29","doi-asserted-by":"crossref","unstructured":"Sokolovskii R., Agarwal P., Croquevielle L.A., Zhou Z., Heinis T.: Coding over coupon collector channels for combinatorial motif-based DNA storage. arXiv preprint (2024). arXiv:2406.04141.","DOI":"10.1109\/TCOMM.2024.3506938"},{"issue":"1\u20132","key":"1857_CR30","first-page":"91","volume":"19","author":"T Sz\u0151nyi","year":"1991","unstructured":"Sz\u0151nyi T.: Combinatorial problems for abelian groups arising from geometry. Period. Polytech. Transp. Eng. 19(1\u20132), 91\u2013100 (1991).","journal-title":"Period. Polytech. Transp. Eng."},{"issue":"1","key":"1857_CR31","doi-asserted-by":"publisher","first-page":"1","DOI":"10.1038\/srep14138","volume":"5","author":"S Tabatabaei Yazdi","year":"2015","unstructured":"Tabatabaei Yazdi S., Yuan Y., Ma J., Zhao H., Milenkovic O.: \u201cA rewritable, random-access DNA-based storage system. Sci. Rep. 5(1), 1\u201310 (2015).","journal-title":"Sci. Rep."},{"issue":"1","key":"1857_CR32","doi-asserted-by":"publisher","first-page":"5011","DOI":"10.1038\/s41598-017-05188-1","volume":"7","author":"SHT Yazdi","year":"2017","unstructured":"Yazdi S.H.T., Gabrys R., Milenkovic O.: Portable and error-free DNA-based data storage. Sci. Rep. 7(1), 5011 (2017).","journal-title":"Sci. Rep."},{"issue":"3","key":"1857_CR33","doi-asserted-by":"publisher","first-page":"230","DOI":"10.1109\/TMBMC.2016.2537305","volume":"1","author":"SHT Yazdi","year":"2015","unstructured":"Yazdi S.H.T., Kiah H.M., Garcia-Ruiz E., Ma J., Zhao H., Milenkovic O.: DNA-based storage: trends and methods. IEEE Trans. Mol. Biol. Multi-Scale Commun. 1(3), 230\u2013248 (2015).","journal-title":"IEEE Trans. Mol. Biol. Multi-Scale Commun."}],"container-title":["Designs, Codes and Cryptography"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/s10623-026-01857-3.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/link.springer.com\/article\/10.1007\/s10623-026-01857-3","content-type":"text\/html","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/s10623-026-01857-3.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2026,5,29]],"date-time":"2026-05-29T06:19:59Z","timestamp":1780035599000},"score":1,"resource":{"primary":{"URL":"https:\/\/link.springer.com\/10.1007\/s10623-026-01857-3"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2026,5]]},"references-count":33,"journal-issue":{"issue":"5","published-print":{"date-parts":[[2026,5]]}},"alternative-id":["1857"],"URL":"https:\/\/doi.org\/10.1007\/s10623-026-01857-3","relation":{},"ISSN":["0925-1022","1573-7586"],"issn-type":[{"value":"0925-1022","type":"print"},{"value":"1573-7586","type":"electronic"}],"subject":[],"published":{"date-parts":[[2026,5]]},"assertion":[{"value":"8 October 2025","order":1,"name":"received","label":"Received","group":{"name":"ArticleHistory","label":"Article History"}},{"value":"16 March 2026","order":2,"name":"revised","label":"Revised","group":{"name":"ArticleHistory","label":"Article History"}},{"value":"15 April 2026","order":3,"name":"accepted","label":"Accepted","group":{"name":"ArticleHistory","label":"Article History"}},{"value":"16 May 2026","order":4,"name":"first_online","label":"First Online","group":{"name":"ArticleHistory","label":"Article History"}},{"order":1,"name":"Ethics","group":{"name":"EthicsHeading","label":"Declarations"}},{"value":"The authors declare no conflict of interest.","order":2,"name":"Ethics","group":{"name":"EthicsHeading","label":"Conflict of interest"}}],"article-number":"114"}}