Journal article · 2026 · Open access

Making It to First: The Random Access Problem in DNA Storage

Avital Boruchovsky, Ohad Elishco, Ryan Gabrys, Anina Gruica, Itzhak Tamo, Eitan Yaakobi

IEEE Transactions on Information Theory, 72(8), 5623–5638 · Published 3 June 2026 · DOI 10.1109/tit.2026.3699871

Open PDFView at the publisherCite this paper

In brief

“Making It to First: The Random Access Problem in DNA Storage” is a 2026 journal article by Avital Boruchovsky and 5 co-authors, published in IEEE Transactions on Information Theory. OpenAlex counts 17 citations as of 18 November 2026, which puts it in the top 1% of works published in 2026 by citations. It is open access under a CC BY licence: the full text is free to read at arXiv (Cornell University).

Citations
17
Most cited in
2026 (17)
Field-weighted impact
30.43
References
26
Authors
6

Abstract

In this paper, we study theRandom Access Problemin DNA storage, which addresses the challenge of retrieving a specific information strand from a DNA-based storage system. In this framework, the data is represented bykinformation strands which represent the data and are encoded intonstrands using a linear code. Then, each sequencing read returns one encoded strand which is chosen uniformly at random. The goal under this paradigm is to design codes that minimize the expected number of reads required to recover an arbitrary information strand. We fully solve the case whenk= 2, showing that the best possible code attains a random access expectation of 1 + 2/ √2+1 ≈ 0.914 · 2 forqlarge enough. Moreover, we extend a previous construction, originally developed fork= 3, to arbitrary values ofk. Our construction usesBk−1sequences overZq−1, that always exist over large finite fields. We show that for everyk≥ 4, this generalized construction outperforms all previous constructions in terms of reducing the random access expectation.

Cite this paper

Formatted from the catalogue record. Check names, capitals and page numbers against the paper before you submit.

APA 7

Boruchovsky, A., Elishco, O., Gabrys, R., Gruica, A., Tamo, I., & Yaakobi, E. (2026). Making It to First: The Random Access Problem in DNA Storage. IEEE Transactions on Information Theory, 72(8), 5623–5638. https://doi.org/10.1109/tit.2026.3699871

MLA 9

Boruchovsky, Avital, et al. “Making It to First: The Random Access Problem in DNA Storage.” IEEE Transactions on Information Theory, vol. 72, no. 8, 2026, pp. 5623–5638. https://doi.org/10.1109/tit.2026.3699871.

Chicago

Boruchovsky, Avital, Ohad Elishco, Ryan Gabrys, Anina Gruica, Itzhak Tamo, and Eitan Yaakobi. 2026. “Making It to First: The Random Access Problem in DNA Storage.” IEEE Transactions on Information Theory 72 (8): 5623–5638. https://doi.org/10.1109/tit.2026.3699871.

Harvard

Boruchovsky, A. et al. (2026) ‘Making It to First: The Random Access Problem in DNA Storage’, IEEE Transactions on Information Theory, 72(8), pp. 5623–5638. doi:10.1109/tit.2026.3699871.

IEEE

A. Boruchovsky, O. Elishco, R. Gabrys, A. Gruica, I. Tamo, and E. Yaakobi, “Making It to First: The Random Access Problem in DNA Storage,” IEEE Transactions on Information Theory, vol. 72, no. 8, pp. 5623–5638, 2026, doi: 10.1109/tit.2026.3699871.

BibTeX

@article{boruchovsky2026making,
  title     = {{Making It to First: The Random Access Problem in DNA Storage}},
  author    = {Boruchovsky, Avital and Elishco, Ohad and Gabrys, Ryan and Gruica, Anina and Tamo, Itzhak and Yaakobi, Eitan},
  journal   = {IEEE Transactions on Information Theory},
  year      = {2026},
  volume    = {72},
  number    = {8},
  pages     = {5623--5638},
  doi       = {10.1109/tit.2026.3699871},
  url       = {https://doi.org/10.1109/tit.2026.3699871}
}

Download for a reference manager: BibTeX (.bib) · RIS for Zotero, Mendeley and EndNote (.ris)

Topic and keywords

Physical Sciences › Mathematics › Theoretical Computer Science › DNA and Biological Computing

  • DNA data storage
  • linear codes
  • finite fields
  • code construction
  • error-correcting codes

Work with this paper

Most-cited papers in Mathematics

All highly cited Mathematics papers

Questions about this paper

How do I cite this paper in APA style?

Boruchovsky, A., Elishco, O., Gabrys, R., Gruica, A., Tamo, I., & Yaakobi, E. (2026). Making It to First: The Random Access Problem in DNA Storage. IEEE Transactions on Information Theory, 72(8), 5623–5638. https://doi.org/10.1109/tit.2026.3699871

How many times has this paper been cited?

17 times, according to OpenAlex on 18 November 2026. Google Scholar and Scopus count different sets of sources, so their numbers differ.

Is this paper free to read?

Yes. It is open access at arXiv (Cornell University): sign in and open the PDF from this page.

Who wrote this paper?

Avital Boruchovsky, Ohad Elishco, Ryan Gabrys, Anina Gruica, Itzhak Tamo, Eitan Yaakobi.

What is the DOI of this paper?

10.1109/tit.2026.3699871, permanently at https://doi.org/10.1109/tit.2026.3699871. Sign in and open it from this page.

Bibliographic data from OpenAlex (CC0), last checked 18 November 2026. ResearchGuru does not host this paper; once you are signed in, the links open it at the publisher or the repository that does.