3 citations · 5 across the 15 of their papers we have counts for
18 papers · 1 filter
On the Capacity of Noisy Frequency-based Channels
Yuval Gerzon, Ilan Shomorony, Nir Weinberger
We investigate the capacity of noisy frequency-based channels, motivated by DNA data storage in the short-molecule regime, where information is encoded in the frequency of items ty…
Fundamental Limits of Non-Adaptive Group Testing with Markovian Correlation
Aditya Narayan Ravi, Ilan Shomorony
We study a correlated group testing model where items are infected according to a Markov chain, which creates bursty binfection patterns. Focusing on a very sparse infections regim…
Guaranteed Recovery of Unambiguous Clusters
Kayvon Mazooji, Ilan Shomorony
Clustering is often a challenging problem because of the inherent ambiguity in what the "correct" clustering should be. Even when the number of clusters is known, this ambiguit…
Reducing Data Fragmentation in Data Deduplication Systems via Partial Repetition and Coding
Yun-Han Li, Jin Sima, Ilan Shomorony +1
Data deduplication, one of the key features of modern Big Data storage devices, is the process of removing replicas of data chunks stored by different users. Despite the importance…
Recovering a Message from an Incomplete Set of Noisy Fragments
Aditya Narayan Ravi, Alireza Vahid, Ilan Shomorony
We consider the problem of communicating over a channel that breaks the message block into fragments of random lengths, shuffles them out of order, and deletes a random fraction of…
Capacity of Frequency-based Channels: Encoding Information in Molecular Concentrations
Yuval Gerzon, Ilan Shomorony, Nir Weinberger
We consider a molecular channel, in which messages are encoded to the frequency of objects (or concentration of molecules) in a pool, and whose output during reading time is a nois…
An Instance-Based Approach to the Trace Reconstruction Problem
Kayvon Mazooji, Ilan Shomorony
In the trace reconstruction problem, one observes the output of passing a binary string through a deletion channel times and wishes to recover from the re…
Fundamental Limits of Reference-Based Sequence Reordering
Nir Weinberger, Ilan Shomorony
The problem of reconstructing a sequence of independent and identically distributed symbols from a set of equal size, consecutive, fragments, as well as a dependent reference seque…
Fundamental Limits of Multiple Sequence Reconstruction from Substrings
Kel Levick, Ilan Shomorony
The problem of reconstructing a sequence from the set of its length- substrings has received considerable attention due to its various applications in genomics. We study an unco…
Finding a Burst of Positives via Nonadaptive Semiquantitative Group Testing
Yun-Han Li, Ryan Gabrys, Jin Sima +2
Motivated by testing for pathogenic diseases we consider a new nonadaptive group testing problem for which: (1) positives occur within a burst, capturing the fact that infected tes…
On Constant-Weight Binary -Sequences
Jin Sima, Yun-Han Li, Ilan Shomorony +1
Motivated by applications in polymer-based data storage we introduced the new problem of characterizing the code rate and designing constant-weight binary -sequences. Binary $…
Substring Density Estimation from Traces
Kayvon Mazooji, Ilan Shomorony
In the trace reconstruction problem, one seeks to reconstruct a binary string from a collection of traces, each of which is obtained by passing through a deletion channel.…
Reassembly Codes for the Chop-and-Shuffle Channel
Sajjad Nassirpour, Ilan Shomorony, Alireza Vahid
We study the problem of retrieving data from a channel that breaks the input sequence into a set of unordered fragments of random lengths, which we refer to as the chop-and-shuffle…
Coded Shotgun Sequencing
Aditya Narayan Ravi, Alireza Vahid, Ilan Shomorony
Most DNA sequencing technologies are based on the shotgun paradigm: many short reads are obtained from random unknown locations in the DNA sequence. A fundamental question, studied…
Private DNA Sequencing: Hiding Information in Discrete Noise
Kayvon Mazooji, Roy Dong, Ilan Shomorony
When an individual's DNA is sequenced, sensitive medical information becomes available to the sequencing laboratory. A recently proposed way to hide an individual's genetic informa…
Communicating over the Torn-Paper Channel
Ilan Shomorony, Alireza Vahid
We consider the problem of communicating over a channel that randomly "tears" the message block into small pieces of different sizes and shuffles them. For the binary torn-paper ch…
The Metagenomic Binning Problem: Clustering Markov Sequences
G. Greenberg, I. Shomorony
The goal of metagenomics is to study the composition of microbial communities, typically using high-throughput shotgun sequencing. In the metagenomic binning problem, we observe ra…
Informational Bottlenecks in Two-Unicast Wireless Networks with Delayed CSIT
Alireza Vahid, Ilan Shomorony, Robert Calderbank
We study the impact of delayed channel state information at the transmitters (CSIT) in two-unicast wireless networks with a layered topology and arbitrary connectivity. We introduc…