A storage code is an assignment of symbols to the vertices of a connecte...
Nanopore sequencers, being superior to other sequencing technologies for...
DNA labeling is a powerful tool in molecular biology and biotechnology t...
The Invertible Bloom Lookup Table (IBLT) is a probabilistic data structu...
Although the expenses associated with DNA sequencing have been rapidly
d...
We study a data-driven approach to the bee identification problem for DN...
This paper introduces a new solution to DNA storage that integrates all ...
Constrained coding is a fundamental field in coding theory that tackles
...
We consider gradient coding in the presence of an adversary, controlling...
The Invertible Bloom Lookup Table (IBLT) is a probabilistic concise data...
This paper introduces a new family of reconstruction codes which is moti...
We consider the problem of correcting insertion and deletion errors in t...
The rapid development of DNA storage has brought the deletion and insert...
de Bruijn sequences of order ℓ, i.e., sequences that contain each
ℓ-tupl...
This paper introduces a new family of reconstruction codes which is moti...
Reliability is an inherent challenge for the emerging nonvolatile techno...
The channel output entropy of a transmitted word is the entropy of the
p...
This paper studies the adversarial torn-paper channel. This problem is
m...
Synthetic polymer-based storage seems to be a particularly promising
can...
This paper tackles two problems that are relevant to coding for insertio...
Lifted Reed-Solomon and multiplicity codes are classes of codes, constru...
Resistive memories, such as phase change memories and
resistive random a...
The concept of DNA storage was first suggested in 1959 by Richard Feynma...
The problem of string reconstruction based on its substrings spectrum ha...
The rapid development of DNA storage has brought the deletion and insert...
Motivated by applications in machine learning and archival data storage,...
This paper investigates the problem of correcting multiple criss-cross
d...
This paper studies two families of constraints for two-dimensional and
m...
Locality enables storage systems to recover failed nodes from small subs...
A functional k-batch code of dimension s consists of n servers
storing l...
Partial MDS (PMDS) and sector-disk (SD) codes are classes of erasure
cor...
Private information retrieval (PIR) protocols ensure that a user can dow...
Correcting insertions/deletions as well as substitution errors simultane...
The de Bruijn graph, its sequences, and their various generalizations, h...
This paper studies the problem of constructing codes correcting deletion...
The sequence reconstruction problem, introduced by Levenshtein in 2001,
...
A functional PIR array code is a coding scheme which encodes some s
info...
A private information retrieval (PIR) protocol guarantees that a user ca...
This paper studies the problem of reconstructing a word given several of...
Partial MDS (PMDS) and sector-disk (SD) codes are classes of erasure cod...
In this work private information retrieval (PIR) codes are studied. In a...
In graph theory, a tree is one of the more popular families of graphs wi...
The sequence reconstruction problem, introduced by Levenshtein in 2001,
...
This paper studies reconstruction of strings based upon their substrings...
A covering code is a set of codewords with the property that the union o...
In this paper we consider the problem of encoding data into repeat-free
...
A private proximity retrieval (PPR) scheme is a protocol which
allows a ...
A new family of codes, called clustering-correcting codes, is presented ...
Motivated by DNA-based data storage, we investigate a system where digit...
Private information retrieval (PIR) protocols make it possible to retrie...