Zobrazeno 1 - 10
of 72
pro vyhledávání: '"Elishco, Ohad"'
In this paper, we investigate codes designed to correct two bursts of deletions, where each burst has a length of exactly $b$, where $b>1$. The previous best construction, achieved through the syndrome compression technique, had a redundancy of at mo
Externí odkaz:
http://arxiv.org/abs/2408.03113
Autor:
Elishco, Ohad
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. Our work is motivated by the potential of in-vivo DNA storage, known
Externí odkaz:
http://arxiv.org/abs/2401.04020
Autor:
Kong, Xiangliang, Elishco, Ohad
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 protocols. These codes have been the focus of much attention in recen
Externí odkaz:
http://arxiv.org/abs/2309.06806
A storage code is an assignment of symbols to the vertices of a connected graph $G(V,E)$ with the property that the value of each vertex is a function of the values of its neighbors, or more generally, of a certain neighborhood of the vertex in $G$.
Externí odkaz:
http://arxiv.org/abs/2308.14558
Autor:
Ye, Zuo, Elishco, Ohad
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-machines, emerging medical applications, and brain-machine interfaces that
Externí odkaz:
http://arxiv.org/abs/2302.09842
Autor:
Ye, Zuo, Elishco, Ohad
We first give a construction of binary $t_1$-deletion-$t_2$-insertion-burst correcting codes with redundancy at most $\log(n)+(t_1-t_2-1)\log\log(n)+O(1)$, where $t_1\ge 2t_2$. Then we give an improved construction of binary codes capable of correcti
Externí odkaz:
http://arxiv.org/abs/2211.11658
Autor:
Ye, Zuo, Elishco, Ohad
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 structure of the strings that cannot be uniquely reconstructed (up to re
Externí odkaz:
http://arxiv.org/abs/2208.14963
Autor:
Elishco, Ohad, Huleihel, Wasim
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 part of existing storage systems. Accordingly, this high cost and low th
Externí odkaz:
http://arxiv.org/abs/2204.07013
Autor:
Elishco, Ohad, Barg, Alexander
Motivated by the established notion of storage codes, we consider sets of infinite sequences over a finite alphabet such that every $k$-tuple of consecutive entries is uniquely recoverable from its $l$-neighborhood in the sequence. We address the pro
Externí odkaz:
http://arxiv.org/abs/2010.00589
Akademický článek
Tento výsledek nelze pro nepřihlášené uživatele zobrazit.
K zobrazení výsledku je třeba se přihlásit.
K zobrazení výsledku je třeba se přihlásit.