2 citations · 2 across the 14 of their papers we have counts for
22 papers
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…
Coding for Ordered Composite DNA Sequences
Besart Dollma, Ohad Elishco, Eitan Yaakobi
To increase the information capacity of DNA storage, composite DNA letters were introduced. We propose a novel channel model for composite DNA in which composite sequences are deco…
On Multidimensional 2-Weight-Limited Burst-Correcting Codes
Hagai Berend, Ohad Elishco, Moshe Schwartz
We consider multidimensional codes capable of correcting a burst error of weight at most . When two positions are in error, the burst limits their relative position. We study th…
Making it to First: The Random Access Problem in DNA Storage
Avital Boruchovsky, Ohad Elishco, Ryan Gabrys +3
In this paper, we study the Random Access Problem in DNA storage, which addresses the challenge of retrieving a specific information strand from a DNA-based storage system. In this…
Codes Correcting Two Bursts of Exactly Deletions
Zuo Ye, Yubo Sun, Wenjun Yu +2
In this paper, we investigate codes designed to correct two bursts of deletions, where each burst has a length of exactly , where . The previous best construction, achieved…
On the Long-Term behavior of -tuples Frequencies in Mutation Systems
Ohad Elishco
In response to the evolving landscape of data storage, researchers have increasingly explored non-traditional platforms, with DNA-based storage emerging as a cutting-edge solution.…
Bounds and Constructions for Generalized Batch Codes
Xiangliang Kong, Ohad Elishco
Private information retrieval (PIR) codes and batch codes are two important types of codes that are designed for coded distributed storage systems and private information retrieval…
Storage codes and recoverable systems on lines and grids
Alexander Barg, Ohad Elishco, Ryan Gabrys +2
A storage code is an assignment of symbols to the vertices of a connected graph with the property that the value of each vertex is a function of the values of its neighbor…
Codes Over Absorption Channels
Zuo Ye, Ohad Elishco
In this paper, we present a novel communication channel, called the absorption channel, inspired by information transmission in neurons. Our motivation comes from in-vivo nano-mach…
Reconstruction of a Single String from a Part of its Composition Multiset
Zuo Ye, Ohad Elishco
Motivated by applications in polymer-based data storage, we study the problem of reconstructing a string from part of its composition multiset. We give a full description of the st…
Optimal Reference for DNA Synthesis
Ohad Elishco, Wasim Huleihel
In the recent years, DNA has emerged as a potentially viable storage technology. DNA synthesis, which refers to the task of writing the data into DNA, is perhaps the most costly pa…
Recoverable Systems
Ohad Elishco, Alexander Barg
Motivated by the established notion of storage codes, we consider sets of infinite sequences over a finite alphabet such that every -tuple of consecutive entries is uniquely rec…
Repeat-Free Codes
Ohad Elishco, Ryan Gabrys, Eitan Yaakobi +1
In this paper we consider the problem of encoding data into \textit{repeat-free} sequences in which sequences are imposed to contain any -tuple at most once (for predefined )…
Capacity of dynamical storage systems
Ohad Elishco, Alexander Barg
We introduce a dynamical model of node repair in distributed storage systems wherein the storage nodes are subjected to failures according to independent Poisson processes. The mai…
The Capacity of Some Pólya String Models
Ohad Elishco, Farzad Farnoud, Moshe Schwartz +1
We study random string-duplication systems, which we call Pólya string models. These are motivated by DNA storage in living organisms, and certain random mutation processes that af…
On Independence and Capacity of Multidimensional Semiconstrained Systems
Ohad Elishco, Tom Meyerovitch, Moshe Schwartz
We find a new formula for the limit of the capacity of certain sequences of multidimensional semiconstrained systems as the dimension tends to infinity. We do so by generalizing th…
Encoding Semiconstrained Systems
Ohad Elishco, Tom Meyerovitch, Moshe Schwartz
Semiconstrained systems were recently suggested as a generalization of constrained systems, commonly used in communication and data-storage applications that require certain offend…
Semi-constrained Systems
Ohad Elishco, Tom Meyerovitch, Moshe Schwartz
When transmitting information over a noisy channel, two approaches, dating back to Shannon's work, are common: assuming the channel errors are independent of the transmitted conten…
Capacity and coding for the Ising Channel with Feedback
Ohad Elishco, Haim Permuter
The Ising channel, which was introduced in 1990, is a channel with memory that models Inter-Symbol interference. In this paper we consider the Ising channel with feedback and find…