pith. sign in

arxiv: 2602.12800 · v3 · pith:FZUO3CQZnew · submitted 2026-02-13 · 💻 cs.IT · math.IT

Concatenated Codes for Short-Molecule DNA Storage with Sequencing Channels of Positive Zero-Undetected-Error Capacity

Ran Tamir , Nir Weinberger , Albert Guill\'en i F\`abregas This is my paper

Pith reviewed 2026-05-21 13:47 UTC · model grok-4.3

classification 💻 cs.IT math.IT
keywords DNA storageconcatenated codessequencing channelzero-undetected-error decodinglinear block codesachievability boundinformation scaling
0
0 comments X

The pith

Concatenated coding with linear inner codes and zero-undetected-error decoding yields an achievability bound for scaling of reliable information bits in short-molecule DNA storage

A machine-rendered reading of the paper's core claim, the machinery that carries it, and where it could break.

The paper examines reliable information storage in DNA systems that encode data into short molecules and recover it through noisy sequencing. It introduces a concatenated scheme where the outer code manages random sampling of molecules and the inner code, formed by a linear block code with zero-undetected-error decoding, corrects sequencing errors. The symmetry of the sequencing channel makes the overall maximum-likelihood decoder tractable, producing a bound on how the number of storable information bits scales with system size. A supporting result shows that random linear codes achieve exponentially vanishing error probability below a critical rate that lower-bounds the zero-undetected-error capacity. Readers care because the work supplies concrete coding constructions and scaling guarantees for DNA storage that must handle both sampling variability and real sequencing noise.

Core claim

By using a concatenated architecture with an outer code for sampling and an inner linear block code decoded under the zero-undetected-error rule, the scheme admits an analyzable maximum-likelihood decoder for the symmetric sequencing channel. This structure produces an achievability bound on the scaling of the number of information bits that can be stored reliably. Independently, random linear block codes under zero-undetected-error decoding are shown to have average error probability that converges to zero exponentially fast with block length whenever the rate lies below a critical value known to lower-bound the zero-undetected-error capacity.

What carries the argument

Linear block code combined with zero-undetected-error decoding as the inner scheme, which renders the maximum-likelihood decoder for the concatenated system amenable to analysis under symmetric sequencing noise.

If this is right

  • The number of reliably stored information bits grows according to the derived achievability bound as the number of molecules increases.
  • Random linear block codes achieve exponentially small average error probability under zero-undetected-error decoding below a critical rate.
  • The critical rate provides a lower bound on the zero-undetected-error capacity of the sequencing channel.
  • The outer code isolates random sampling effects from the inner code's handling of sequencing errors.

Where Pith is reading between the lines

These are editorial extensions of the paper, not claims the author makes directly.

  • The same separation of sampling and noise via concatenation may apply to other storage or communication settings that combine random access with additive noise.
  • Standard families of linear codes could be substituted for the inner code in experimental DNA storage prototypes to check the predicted scaling.
  • Removing the symmetry assumption would require new decoder analysis but could extend the results to more realistic sequencing models.

Load-bearing premise

The sequencing channel is symmetric and the inner decoder is a zero-undetected-error decoder for a linear block code.

What would settle it

A simulation or calculation showing that the average error probability of random linear block codes under zero-undetected-error decoding fails to decay exponentially with block length for rates below the critical value on a symmetric channel.

read the original abstract

We study the amount of reliable information that can be stored in a DNA-based storage system with noisy sequencing, where each codeword is composed of short DNA molecules. We analyze a concatenated coding scheme, where the outer code is designed to handle the random sampling, while the inner code is designed to handle the random sequencing noise. We assume that the sequencing channel is symmetric and choose the inner coding scheme to be composed by a linear block code and a zero-undetected-error decoder. As a byproduct, the resulting optimal maximum-likelihood decoder land itself for an amenable analysis, and we are able to derive an achievability bound for the scaling of the number of information bits that can be reliably stored. As a result of independent interest, we prove that the average error probability of random linear block codes under zero-undetected-error decoding converges to zero exponentially fast with the block length, as long as its coding rate does not exceed some critical value, which is known to serve as a lower bound to the zero-undetected-error capacity.

Editorial analysis

A structured set of objections, weighed in public.

Desk editor's note, referee report, simulated authors' rebuttal, and a circularity audit. Tearing a paper down is the easy half of reading it; the pith above is the substance, this is the friction.

Referee Report

2 major / 2 minor

Summary. The paper analyzes a concatenated coding scheme for DNA storage with short molecules and noisy sequencing channels. The outer code manages random sampling of molecules, while the inner code uses a linear block code paired with a zero-undetected-error (ZUE) decoder. Under the assumption that the sequencing channel is symmetric, the resulting maximum-likelihood decoder permits derivation of an achievability bound on the scaling of reliably storable information bits. As a byproduct, the authors prove that random linear block codes under ZUE decoding achieve exponentially decaying average error probability below a critical rate that lower-bounds the ZUE capacity.

Significance. If the central achievability result and the byproduct exponent hold, the work supplies a concrete scaling law for reliable DNA storage under realistic sequencing noise and sampling, with the symmetry assumption enabling clean separation of error events. The independent proof for random linear codes under ZUE decoding strengthens the contribution by linking directly to zero-undetected-error capacity bounds.

major comments (2)
  1. [§3.2] §3.2, main achievability theorem: the scaling bound is derived under the explicit assumption of channel symmetry to ensure the inner ZUE decoder yields an overall ML decoder whose error probability can be bounded via the random-linear-code exponent. The manuscript should clarify whether the exponential convergence still holds (perhaps with a modified rate) when symmetry is relaxed, or provide a concrete counter-example showing that undetected-error events fail to separate from the outer code's sampling handling.
  2. [Theorem 2] Theorem 2 (byproduct result on random linear codes): the critical rate is asserted to lower-bound the ZUE capacity and to guarantee exponential decay of average error probability. The proof sketch invokes standard random-coding arguments, but the precise step where the ZUE decoder's acceptance region produces the claimed exponent (distinct from ordinary ML) needs an expanded display of the union bound or Chernoff step to confirm it is not merely re-deriving the ordinary error exponent.
minor comments (2)
  1. [Abstract] Abstract, line 7: 'land itself for an amenable analysis' is a grammatical error; replace with 'lends itself to an amenable analysis'.
  2. [Notation] Notation section: the definition of the critical rate R_crit should be cross-referenced explicitly to the ZUE capacity expression used later in the concatenation analysis.

Simulated Author's Rebuttal

2 responses · 0 unresolved

We thank the referee for the detailed and constructive report. We address the two major comments point by point below and indicate the revisions we will make to strengthen the manuscript.

read point-by-point responses

  1. Referee: [§3.2] §3.2, main achievability theorem: the scaling bound is derived under the explicit assumption of channel symmetry to ensure the inner ZUE decoder yields an overall ML decoder whose error probability can be bounded via the random-linear-code exponent. The manuscript should clarify whether the exponential convergence still holds (perhaps with a modified rate) when symmetry is relaxed, or provide a concrete counter-example showing that undetected-error events fail to separate from the outer code's sampling handling.

    Authors: We agree that symmetry is essential to the argument in §3.2. Under the symmetric-channel assumption the inner zero-undetected-error decoder coincides with the overall maximum-likelihood decoder, which cleanly separates the inner-code error events from the outer-code sampling process and permits the random-linear-code exponent to be applied directly. When symmetry is removed, the overall decoder is no longer guaranteed to be ML in the same manner, and undetected-error events may interact with the random sampling in ways that are not bounded by the same exponent. In the revised manuscript we will insert a short paragraph immediately after the statement of the main achievability theorem that (i) explicitly recalls the role of symmetry in obtaining the ML property and (ii) states that relaxing symmetry remains an open question whose resolution would require a more involved union bound over joint sampling-and-sequencing error events. Because constructing a concrete counter-example or proving a modified-rate result would demand substantial additional technical work outside the present scope, we do not attempt either here; the added paragraph will instead frame the symmetry assumption as a necessary modeling choice for the current analysis. revision: partial

  2. Referee: [Theorem 2] Theorem 2 (byproduct result on random linear codes): the critical rate is asserted to lower-bound the ZUE capacity and to guarantee exponential decay of average error probability. The proof sketch invokes standard random-coding arguments, but the precise step where the ZUE decoder's acceptance region produces the claimed exponent (distinct from ordinary ML) needs an expanded display of the union bound or Chernoff step to confirm it is not merely re-deriving the ordinary error exponent.

    Authors: We appreciate the request for greater transparency in the proof of Theorem 2. The distinction from ordinary ML decoding lies in the acceptance region of the zero-undetected-error decoder: an error is declared only when a non-transmitted codeword lies inside the decoder’s acceptance set, which is strictly smaller than the ML decision region. Consequently the union bound is taken solely over the undetected-error events rather than over all incorrect codewords. In the revised manuscript we will replace the current proof sketch with a fully expanded derivation that (a) writes the average error probability as an expectation over the random linear code of the probability that any other codeword enters the ZUE acceptance region, (b) applies the standard union bound over the M−1 competing codewords, and (c) invokes a Chernoff bound on the pairwise undetected-error probability whose exponent is expressed in terms of the ZUE divergence rather than the ordinary Bhattacharyya or Gallager function. This explicit display will make evident that the resulting exponent is the one associated with the zero-undetected-error capacity lower bound and is not identical to the classical random-coding exponent. revision: yes

Circularity Check

0 steps flagged

No circularity: achievability bound derived from explicit channel symmetry and independent byproduct proof on random linear codes

full rationale

The paper explicitly assumes a symmetric sequencing channel and selects an inner linear block code paired with a zero-undetected-error decoder. This choice is stated to make the overall maximum-likelihood decoder amenable to analysis, allowing derivation of an achievability bound on the scaling of reliable information bits. The byproduct result—that the average error probability of random linear block codes under ZUE decoding decays exponentially below a critical rate lower-bounding ZUE capacity—is presented as a separate derivation of independent interest. No step reduces by construction to a fitted parameter renamed as prediction, a self-definitional loop, or a load-bearing self-citation whose content is unverified. The derivation chain remains self-contained against the stated assumptions and external benchmarks for random coding exponents.

Axiom & Free-Parameter Ledger

0 free parameters · 1 axioms · 0 invented entities

The analysis rests on the symmetry of the sequencing channel and on standard properties of random linear block codes under zero-undetected-error decoding; no free parameters or new entities are introduced in the abstract.

axioms (1)
  • domain assumption The sequencing channel is symmetric
    Invoked to select the inner linear block code and zero-undetected-error decoder and to enable the maximum-likelihood analysis.

pith-pipeline@v0.9.0 · 5721 in / 1265 out tokens · 54070 ms · 2026-05-21T13:47:56.404082+00:00 · methodology

discussion (0)

Sign in with ORCID, Apple, or X to comment. Anyone can read and Pith papers without signing in.

Reference graph

Works this paper leans on

68 extracted references · 68 canonical work pages

  1. [1]

    Next-generation digital information storage in DNA,

    G. M. Church, Y . Gao, and S. Kosuri, “Next-generation digital information storage in DNA,”Science, vol. 337, no. 6102, pp. 1628–1628, 2012

    work page 2012

  2. [2]

    Towards practical, high-capacity, low-maintenance information storage in synthesized dna,

    N. Goldman, P. Bertone, S. Chen, C. Dessimoz, E. M. LeProust, B. Sipos, and E. Birney, “Towards practical, high-capacity, low-maintenance information storage in synthesized dna,”nature, vol. 494, no. 7435, pp. 77–80, 2013

    work page 2013

  3. [3]

    Robust chemical preservation of digital information on dna in silica with error-correcting codes,

    R. N. Grass, R. Heckel, M. Puddu, D. Paunescu, and W. J. Stark, “Robust chemical preservation of digital information on dna in silica with error-correcting codes,”Angewandte Chemie International Edition, vol. 54, no. 8, pp. 2552–2555, 2015

    work page 2015

  4. [4]

    A rewritable, random-access DNA-based storage system,

    S. H. Tabatabaei Yazdi, Y . Yuan, J. Ma, H. Zhao, and O. Milenkovic, “A rewritable, random-access DNA-based storage system,”Scientific reports, vol. 5, no. 1, p. 14138, 2015

    work page 2015

  5. [5]

    DNA fountain enables a robust and efficient storage architecture,

    Y . Erlich and D. Zielinski, “DNA fountain enables a robust and efficient storage architecture,”Science, vol. 355, no. 6328, pp. 950–954, 2017

    work page 2017

  6. [6]

    Random access in large-scale DNA data storage,

    L. Organick, S. D. Ang, Y . Chen, R. Lopez, S. Yekhanin, K. Makarychev, M. Z. Racz, G. Kamath, P. Gopalan, and B. Nguyen, “Random access in large-scale DNA data storage,”Nature biotechnology, vol. 36, no. 3, pp. 242–248, 2018

    work page 2018

  7. [7]

    Low cost DNA data storage using photolithographic synthesis and advanced information reconstruction and error correction,

    P. L. Antkowiak, J. Lietard, M. Z. Darestani, M. M. Somoza, W. J. Stark, R. Heckel, and R. N. Grass, “Low cost DNA data storage using photolithographic synthesis and advanced information reconstruction and error correction,”Nature communications, vol. 11, no. 1, pp. 1–10, 2020

    work page 2020

  8. [8]

    Survey for a decade of coding for DNA storage,

    O. Sabary, H. M. Kiah, P. H. Siegel, and E. Yaakobi, “Survey for a decade of coding for DNA storage,”IEEE Transactions on Molecular, Biological, and Multi-Scale Communications, vol. 10, no. 2, pp. 253–271, 2024. February 18, 2026 DRAFT 36

    work page 2024

  9. [9]

    Anchor-based correction of substitutions in indexed sets,

    A. Lenz, P. H. Siegel, A. Wachter-Zeh, and E. Yaakobi, “Anchor-based correction of substitutions in indexed sets,” in IEEE International Symposium on Information Theory. IEEE, 2019, pp. 757–761

    work page 2019

  10. [10]

    Coding over sets for DNA storage,

    ——, “Coding over sets for DNA storage,”IEEE Transactions on Information Theory, vol. 66, no. 4, pp. 2331–2351, 2019

    work page 2019

  11. [11]

    An upper bound on the capacity of the DNA storage channel,

    ——, “An upper bound on the capacity of the DNA storage channel,” inIEEE Information Theory Workshop. IEEE, 2019, pp. 1–5

    work page 2019

  12. [12]

    Achievable rates of concatenated codes in DNA storage under substitution errors,

    A. Lenz, L. Welter, and S. Puchinger, “Achievable rates of concatenated codes in DNA storage under substitution errors,” inInternational Symposium on Information Theory and Its Applications. IEEE, 2020, pp. 269–273

    work page 2020

  13. [13]

    Achieving the capacity of the DNA storage channel,

    A. Lenz, P. H. Siegel, A. Wachter-Zeh, and E. Yaakobi, “Achieving the capacity of the DNA storage channel,” inIEEE International Conference on Acoustics, Speech and Signal Processing. IEEE, 2020, pp. 8846–8850

    work page 2020

  14. [14]

    Error probability bounds for coded-index DNA storage channels,

    N. Weinberger, “Error probability bounds for coded-index DNA storage channels,”IEEE Transactions on Information Theory, vol. 68, no. 11, pp. 7005–7022, 2022

    work page 2022

  15. [15]

    DNA-based storage: Models and fundamental limits,

    I. Shomorony and R. Heckel, “DNA-based storage: Models and fundamental limits,”IEEE Transactions on Information Theory, vol. 67, no. 6, pp. 3675–3689, 2021

    work page 2021

  16. [16]

    Information-theoretic foundations of DNA data storage,

    ——, “Information-theoretic foundations of DNA data storage,”Foundations and Trends® in Communications and Information Theory, vol. 19, no. 1, pp. 1–106, 2022

    work page 2022

  17. [17]

    The DNA storage channel: Capacity and error probability bounds,

    N. Weinberger and N. Merhav, “The DNA storage channel: Capacity and error probability bounds,”IEEE Transactions on Information Theory, vol. 68, no. 9, pp. 5657–5700, 2022

    work page 2022

  18. [18]

    Exact error exponents of concatenated codes for DNA storage,

    Y . H. Ling and J. Scarlett, “Exact error exponents of concatenated codes for DNA storage,”IEEE Transactions on Information Theory, 2025

    work page 2025

  19. [19]

    Error exponents for DNA storage codes with a variable number of reads,

    Y . H. Ling, N. Weinberger, and J. Scarlett, “Error exponents for DNA storage codes with a variable number of reads,” arXiv preprint arXiv:2504.17337, 2025

    work page arXiv 2025

  20. [20]

    Information rates over multi-view channels,

    V . A. Rameshwar and N. Weinberger, “Information rates over multi-view channels,”IEEE Transactions on Information Theory, 2024

    work page 2024

  21. [21]

    On achievable rates over noisy nanopore channels,

    ——, “On achievable rates over noisy nanopore channels,”arXiv preprint arXiv:2501.02917, 2025

    work page arXiv 2025

  22. [22]

    Coded shotgun sequencing,

    A. N. Ravi, A. Vahid, and I. Shomorony, “Coded shotgun sequencing,”IEEE Journal on Selected Areas in Information Theory, vol. 3, no. 1, pp. 147–159, 2022

    work page 2022

  23. [23]

    An information theory for out-of-order media with applications in dna data storage,

    ——, “An information theory for out-of-order media with applications in dna data storage,”IEEE Transactions on Molecular, Biological, and Multi-Scale Communications, vol. 10, no. 2, pp. 334–348, 2024

    work page 2024

  24. [24]

    On achievable rates for the shotgun sequencing channel with erasures,

    H. Narayanan, P. Krishnan, and N. Parekh, “On achievable rates for the shotgun sequencing channel with erasures,” in 2024 IEEE International Symposium on Information Theory (ISIT). IEEE, 2024, pp. 1730–1735

    work page 2024

  25. [25]

    Adversarial torn-paper codes,

    D. Bar-Lev, S. Marcovich, E. Yaakobi, and Y . Yehezkeally, “Adversarial torn-paper codes,”IEEE Transactions on Information Theory, vol. 69, no. 10, pp. 6414–6427, 2023

    work page 2023

  26. [26]

    Torn-paper coding,

    I. Shomorony and A. Vahid, “Torn-paper coding,”IEEE Transactions on Information Theory, vol. 67, no. 12, pp. 7904– 7913, 2021

    work page 2021

  27. [27]

    Information rates of the noisy nanopore channel,

    B. McBain, E. Viterbo, and J. Saunderson, “Information rates of the noisy nanopore channel,”IEEE Transactions on Information Theory, vol. 70, no. 8, pp. 5640–5652, 2024

    work page 2024

  28. [28]

    Achievable rates of nanopore-based DNA storage,

    B. McBain and E. Viterbo, “Achievable rates of nanopore-based DNA storage,”IEEE Journal on Selected Areas in Information Theory, 2025

    work page 2025

  29. [29]

    Neural polar decoders for DNA data storage,

    Z. Aharoni and H. D. Pfister, “Neural polar decoders for DNA data storage,”arXiv preprint arXiv:2506.17076, 2025

    work page arXiv 2025

  30. [30]

    An end-to-end coding scheme fo r DNA-based data storage with nanopore-sequenced reads,

    L. Welter, R. Sokolovskii, T. Heinis, A. Wachter-Zeh, E. Rosneset al., “An end-to-end coding scheme for DNA-based data storage with nanopore-sequenced reads,”arXiv preprint arXiv:2406.12955, 2024. DRAFT February 18, 2026 37

    work page arXiv 2024

  31. [31]

    Input optimization in the composite DNA storage channel,

    A. Kobovich and N. Weinberger, “Input optimization in the composite DNA storage channel,”IEEE Journal on Selected Areas in Information Theory, 2025

    work page 2025

  32. [32]

    Scalable and robust DNA-based storage via coding theory and deep learning,

    D. Bar-Lev, I. Orr, O. Sabary, T. Etzion, and E. Yaakobi, “Scalable and robust DNA-based storage via coding theory and deep learning,”Nature Machine Intelligence, pp. 1–11, 2025

    work page 2025

  33. [33]

    The secure storage capacity of a DNA wiretap channel model,

    P. K. Vippathalla and N. Kashyap, “The secure storage capacity of a DNA wiretap channel model,”IEEE Transactions on Information Theory, vol. 69, no. 9, pp. 5550–5569, 2023

    work page 2023

  34. [34]

    Secret sharing for DNA probability vectors,

    W. Zhang and Z. Wang, “Secret sharing for DNA probability vectors,” inICC 2024-IEEE International Conference on Communications. IEEE, 2024, pp. 4578–4583

    work page 2024

  35. [35]

    Ramp secret sharing for composite DNA,

    ——, “Ramp secret sharing for composite DNA,”IEEE Journal on Selected Areas in Information Theory, 2025

    work page 2025

  36. [36]

    A characterization of the DNA data storage channel,

    R. Heckel, G. Mikutis, and R. N. Grass, “A characterization of the DNA data storage channel,”Scientific reports, vol. 9, no. 1, p. 9663, 2019

    work page 2019

  37. [37]

    Capacity of frequency-based channels: Encoding information in molecular concentrations,

    Y . Gerzon, I. Shomorony, and N. Weinberger, “Capacity of frequency-based channels: Encoding information in molecular concentrations,”IEEE Transactions on Information Theory, 2025

    work page 2025

  38. [38]

    DNA storage in the short molecule regime,

    R. Tamir, N. Weinberger, and A. Guillén i Fàbregas, “DNA storage in the short molecule regime,”arXiv preprint arXiv:2511.14284, 2025

    work page arXiv 2025

  39. [39]

    Reading and writing digital data in DNA,

    L. C. Meiser, P. L. Antkowiak, W. D. Koch, J.and Chen, A. X. Kohll, W. J. Stark, R. Heckel, and R. Grass, “Reading and writing digital data in DNA,”Nature protocols, vol. 15, no. 1, pp. 86–101, 2020

    work page 2020

  40. [40]

    Exact error exponents for a concatenated coding based class of DNA storage codes,

    Y . H. Ling and J. Scarlett, “Exact error exponents for a concatenated coding based class of DNA storage codes,” in2024 IEEE International Symposium on Information Theory (ISIT). IEEE, 2024, pp. 3426–3431

    work page 2024

  41. [41]

    Transmission capacity with zero error and erasure,

    M. S. Pinsker and A. Y . Sheverdyaev, “Transmission capacity with zero error and erasure,”Problemy Peredachi Informatsii, vol. 6, no. 1, pp. 20–24, 1970

    work page 1970

  42. [42]

    Performance bounds for nonbinary linear block codes over memoryless symmetric channels,

    E. Hof, I. Sason, and S. Shamai, “Performance bounds for nonbinary linear block codes over memoryless symmetric channels,”IEEE transactions on information theory, vol. 55, no. 3, pp. 977–996, 2009

    work page 2009

  43. [43]

    Performance bounds for erasure, list, and decision feedback schemes with linear block codes,

    ——, “Performance bounds for erasure, list, and decision feedback schemes with linear block codes,”IEEE Transactions on Information Theory, vol. 56, no. 8, pp. 3754–3778, 2010

    work page 2010

  44. [44]

    On the capacity of noisy frequency-based channels,

    Y . Gerzon, I. Shomorony, and N. Weinberger, “On the capacity of noisy frequency-based channels,”arXiv preprint arXiv:2601.10329, 2026

    work page arXiv 2026

  45. [45]

    The lattice-input discrete-time Poisson channel,

    F. Bello, Á. Martin, T. Rischewski, and G. Seroussi, “The lattice-input discrete-time Poisson channel,” in2024 IEEE International Symposium on Information Theory (ISIT). IEEE, 2024, pp. 3624–3629

    work page 2024

  46. [46]

    Achievable rates and error probability bounds of frequency-based channels of unlimited input resolution,

    R. Tamir and N. Weinberger, “Achievable rates and error probability bounds of frequency-based channels of unlimited input resolution,”arXiv preprint arXiv:2504.18364, 2025

    work page arXiv 2025

  47. [47]

    High information capacity DNA-based data storage with augmented encoding characters using degenerate bases,

    Y . Choi, T. Ryu, A. C. Lee, H. Choi, H. Lee, J. Park, S.-H. Song, S. Kim, H. Kim, W. Parket al., “High information capacity DNA-based data storage with augmented encoding characters using degenerate bases,”Scientific reports, vol. 9, no. 1, p. 6582, 2019

    work page 2019

  48. [48]

    Error-correcting codes for combinatorial composite DNA,

    O. Sabary, I. Preuss, R. Gabrys, Z. Yakhini, L. Anavy, and E. Yaakobi, “Error-correcting codes for combinatorial composite DNA,” in2024 IEEE International Symposium on Information Theory (ISIT). IEEE, 2024, pp. 109–114

    work page 2024

  49. [49]

    Coding for composite DNA to correct substitutions, strand losses, and deletions,

    F. Walter, O. Sabary, A. Wachter-Zeh, and E. Yaakobi, “Coding for composite DNA to correct substitutions, strand losses, and deletions,” in2024 IEEE International Symposium on Information Theory (ISIT). IEEE, 2024, pp. 97–102

    work page 2024

  50. [50]

    Coding for strand breaks in composite DNA,

    F. Walter and Y . Yehezkeally, “Coding for strand breaks in composite DNA,”arXiv preprint arXiv:2501.15851, 2025

    work page arXiv 2025

  51. [51]

    Data storage in DNA with fewer synthesis cycles using composite DNA letters,

    L. Anavy, I. Vaknin, O. Atar, R. Amit, and Z. Yakhini, “Data storage in DNA with fewer synthesis cycles using composite DNA letters,”Nature biotechnology, vol. 37, no. 10, pp. 1229–1236, 2019. February 18, 2026 DRAFT 38

    work page 2019

  52. [52]

    Coding for the permutation channel with insertions, deletions, substitutions, and erasures,

    M. Kovacevi ´c and V . Y . Tan, “Coding for the permutation channel with insertions, deletions, substitutions, and erasures,” in2017 IEEE International Symposium on Information Theory (ISIT). IEEE, 2017, pp. 1933–1937

    work page 2017

  53. [53]

    Codes in the space of multisets – coding for permutation channels with impairments,

    ——, “Codes in the space of multisets – coding for permutation channels with impairments,”IEEE Transactions on Information Theory, vol. 64, no. 7, pp. 5156–5169, 2018

    work page 2018

  54. [54]

    Coding theorems for noisy permutation channels,

    A. Makur, “Coding theorems for noisy permutation channels,”IEEE Transactions on Information Theory, vol. 66, no. 11, pp. 6723–6748, 2020

    work page 2020

  55. [55]

    Capacity of noisy permutation channels,

    J. Tang and Y . Polyanskiy, “Capacity of noisy permutation channels,”IEEE Transactions on Information Theory, vol. 69, no. 7, pp. 4145–4162, 2023

    work page 2023

  56. [56]

    Permutation capacity region of adder multiple-access channels,

    W. Lu and A. Makur, “Permutation capacity region of adder multiple-access channels,”IEEE Transactions on Information Theory, vol. 70, no. 7, pp. 4693–4720, 2024

    work page 2024

  57. [57]

    A. J. Viterbi and J. K. Omura,Principles of Digital Communication and Coding. Dover Publications, 2009

    work page 2009

  58. [58]

    Random codes: Minimum distances and error exponents,

    A. Barg and G. D. Forney, “Random codes: Minimum distances and error exponents,”IEEE Transactions on Information Theory, vol. 48, no. 9, pp. 2568–2573, 2002

    work page 2002

  59. [59]

    The random coding bound is tight for the average linear code or lattice,

    Y . Domb, R. Zamir, and M. Feder, “The random coding bound is tight for the average linear code or lattice,”IEEE Transactions on Information Theory, vol. 62, no. 1, pp. 121–130, 2015

    work page 2015

  60. [60]

    Multi-access communications with decision feedback decoding,

    I. E. Telatar, “Multi-access communications with decision feedback decoding,” Ph.D. dissertation, Massachusetts Institute of Technology, 1992

    work page 1992

  61. [61]

    Channel capacity for a given decoding metric,

    I. Csiszar and P. Narayan, “Channel capacity for a given decoding metric,”IEEE Transactions on Information Theory, vol. 41, no. 1, pp. 35–43, 1995

    work page 1995

  62. [62]

    Erasure, list, and detection zero-error capacities for low noise and a relation to identification,

    R. Ahlswede, N. Cai, and Z. Zhang, “Erasure, list, and detection zero-error capacities for low noise and a relation to identification,”IEEE Transactions on Information Theory, vol. 42, no. 1, pp. 55–62, 1996

    work page 1996

  63. [63]

    Exponential error bounds for erasure, list, and decision feedback schemes,

    G. Forney, “Exponential error bounds for erasure, list, and decision feedback schemes,”IEEE Transactions on Information Theory, vol. 14, no. 2, pp. 206–220, 1968

    work page 1968

  64. [64]

    A new basic theorem of information theory,

    A. Feinstein, “A new basic theorem of information theory,” 1954

    work page 1954

  65. [65]

    Polyanskiy and Y

    Y . Polyanskiy and Y . Wu,Information Theory: From Coding to Learning. Cambridge University Press, 2023+. [Online]. Available: https://people.lids.mit.edu/yp/homepage/data/itbook-export.pdf

    work page 2023

  66. [66]

    Sharp inequalities related to Gosper’s formula,

    C. Mortici, “Sharp inequalities related to Gosper’s formula,”Comptes Rendus. Mathématique, vol. 348, no. 3-4, pp. 137– 140, 2010

    work page 2010

  67. [67]

    On choosing and bounding probability metrics,

    A. L. Gibbs and F. E. Su, “On choosing and bounding probability metrics,”International statistical review, vol. 70, no. 3, pp. 419–435, 2002

    work page 2002

  68. [68]

    A stochastic approach to the gamma function,

    L. Gordon, “A stochastic approach to the gamma function,”The American Mathematical Monthly, vol. 101, no. 9, pp. 858–865, 1994. DRAFT February 18, 2026

    work page 1994