The geometry of codes for random access in DNA storage

DOI10.1007/S10623-026-01857-3MaRDI QIDQ7254971zbMATH OpenFDO

Authors Anina Gruica, Maria Montanucci, Ferdinando Zullo

Publication date 29 May 2026

Published in Designs, Codes and Cryptography (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1007/S10623-026-01857-3

zbMATH Keywords

linear codesarcsDNA data storage

Mathematics Subject Classification ID

Searching and sorting (68P10) Combinatorial structures in finite projective spaces (51E20) Combinatorial codes (94B25)

Cites work

• scientific article; zbMATH DE number 3886512 (Why is no real title available?)
• scientific article; zbMATH DE number 3167451 (Why is no real title available?)
• scientific article; zbMATH DE number 3949153 (Why is no real title available?)
• scientific article; zbMATH DE number 718142 (Why is no real title available?)
• scientific article; zbMATH DE number 1101474 (Why is no real title available?)
• scientific article; zbMATH DE number 3249395 (Why is no real title available?)
• Birthday paradox, coupon collectors, caching algorithms and self- organizing search
• Information-Theoretic Foundations of DNA Data Storage
• More translation planes and semifields from Dembowski-Ostrom polynomials
• On the size of a blocking set in \(\text{PG}(2,p)\)
• The Double Dixie Cup Problem

This page was built for publication: The geometry of codes for random access in DNA storage

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q7254971)