2 citations · 2 across the 14 of their papers we have counts for
4 papers · 1 filter
The Coverage Depth Problem in Distributed DNA Data Storage
Xiangliang Kong, Ohad Elishco, Chen Wang +1
Random sampling in DNA sequencing produces repeated reads, increasing retrieval latency and sequencing cost. We study the coverage-depth problem for full-message recovery in distri…
More on Codes for Combinatorial Composite DNA
Zuo Ye, Omer Sabary, Ryan Gabrys +2
In this paper, we focus on constructions of unique-decodable/list-decodable on the recently studied -composite-asymmetric error-correcting codes (-CAECCs). Let be…
Quantum Codes with Transversal Gates and Sublinear -Stabilizers
Ohad Elishco, Itzhak Tamo
We construct asymmetric quantum CSS codes with transversal \(CCZ\) gates from algebraic expander codes \cite{KT26}. For every fixed \(m\ge 3\), our growing-alphabet codes have leng…
Central Limit Theorem for Mutation Systems
Liav Koram, Ohad Elishco
DNA-based storage has emerged as a promising alternative to traditional data storage methods, offering unmatched advantages in data density, longevity, and sustainability. Two main…