research
∙
08/28/2023
Storage codes and recoverable systems on lines and grids
A storage code is an assignment of symbols to the vertices of a connecte...
share
research
∙
05/17/2023
Error-Correcting Codes for Nanopore Sequencing
Nanopore sequencers, being superior to other sequencing technologies for...
research
∙
05/13/2023
On the Capacity of DNA Labeling
DNA labeling is a powerful tool in molecular biology and biotechnology t...
research
∙
05/10/2023
Coding for IBLTs with Listing Guarantees
The Invertible Bloom Lookup Table (IBLT) is a probabilistic data structu...
research
∙
05/09/2023
Cover Your Bases: How to Minimize the Sequencing Coverage in DNA Storage Systems
Although the expenses associated with DNA sequencing have been rapidly d...
research
∙
05/08/2023
Data-Driven Bee Identification for DNA Strands
We study a data-driven approach to the bee identification problem for DN...
research
∙
04/20/2023
DNA-Correcting Codes: End-to-end Correction in DNA Storage Systems
This paper introduces a new solution to DNA storage that integrates all ...
research
∙
04/03/2023
Universal Framework for Parametric Constrained Coding
Constrained coding is a fundamental field in coding theory that tackles ...
research
∙
03/23/2023
Trading Communication for Computation in Byzantine-Resilient Gradient Coding
We consider gradient coding in the presence of an adversary, controlling...
research
∙
12/28/2022
Invertible Bloom Lookup Tables with Listing Guarantees
The Invertible Bloom Lookup Table (IBLT) is a probabilistic concise data...
research
∙
10/10/2022
Generalized Unique Reconstruction from Substrings
This paper introduces a new family of reconstruction codes which is moti...
research
∙
08/10/2022
Equivalence of Insertion/Deletion Correcting Codes for d-dimensional Arrays
We consider the problem of correcting insertion and deletion errors in t...
research
∙
06/16/2022
On the Size of Balls and Anticodes of Small Diameter under the Fixed-Length Levenshtein Metric
The rapid development of DNA storage has brought the deletion and insert...
research
∙
06/08/2022
Covering Sequences for ℓ-Tuples
de Bruijn sequences of order ℓ, i.e., sequences that contain each ℓ-tupl...
research
∙
05/08/2022
Reconstruction from Substrings with Partial Overlap
This paper introduces a new family of reconstruction codes which is moti...
research
∙
05/08/2022
Codes for Constrained Periodicity
Reliability is an inherent challenge for the emerging nonvolatile techno...
research
∙
02/07/2022
The Input and Output Entropies of the k-Deletion/Insertion Channel
The channel output entropy of a transmitted word is the entropy of the p...
research
∙
01/26/2022
Adversarial Torn-paper Codes
This paper studies the adversarial torn-paper channel. This problem is m...
research
∙
01/21/2022
Insertion and Deletion Correction in Polymer-based Data Storage
Synthetic polymer-based storage seems to be a particularly promising can...
research
∙
01/07/2022
On The Decoding Error Weight of One or Two Deletion Channels
This paper tackles two problems that are relevant to coding for insertio...
research
∙
10/05/2021
Lifted Reed-Solomon Codes and Lifted Multiplicity Codes
Lifted Reed-Solomon and multiplicity codes are classes of codes, constru...
research
∙
09/21/2021
Endurance-Limited Memories: Capacity and Codes
Resistive memories, such as phase change memories and resistive random a...
research
∙
08/31/2021
Deep DNA Storage: Scalable and Robust DNA Storage via Coding Theory and Deep Learning
The concept of DNA storage was first suggested in 1959 by Richard Feynma...
research
∙
08/26/2021
Multi-strand Reconstruction from Substrings
The problem of string reconstruction based on its substrings spectrum ha...
research
∙
03/02/2021
On the Size of Levenshtein Balls
The rapid development of DNA storage has brought the deletion and insert...
research
∙
02/05/2021
Function-Correcting Codes
Motivated by applications in machine learning and archival data storage,...
research
∙
02/04/2021
Multiple Criss-Cross Deletion-Correcting Codes
This paper investigates the problem of correcting multiple criss-cross d...
research
∙
01/31/2021
The Zero Cubes Free and Cubes Unique Multidimensional Constraints
This paper studies two families of constraints for two-dimensional and m...
research
∙
01/25/2021
Correctable Erasure Patterns in Product Topologies
Locality enables storage systems to recover failed nodes from small subs...
research
∙
01/17/2021
Almost Optimal Construction of Functional Batch Codes Using Hadamard Codes
A functional k-batch code of dimension s consists of n servers storing l...
research
∙
09/15/2020
Partial MDS Codes with Regeneration
Partial MDS (PMDS) and sector-disk (SD) codes are classes of erasure cor...
research
∙
07/17/2020
Multi-Server Weakly-Private Information Retrieval
Private information retrieval (PIR) protocols ensure that a user can dow...
research
∙
05/19/2020
Single-Deletion Single-Substitution Correcting Codes
Correcting insertions/deletions as well as substitution errors simultane...
research
∙
05/06/2020
Constrained de Bruijn Codes: Properties, Enumeration, Constructions, and Applications
The de Bruijn graph, its sequences, and their various generalizations, h...
research
∙
04/30/2020
Criss-Cross Deletion Correcting Codes
This paper studies the problem of constructing codes correcting deletion...
research
∙
04/13/2020
Optimal Reconstruction Codes for Deletion Channels
The sequence reconstruction problem, introduced by Levenshtein in 2001, ...
research
∙
01/29/2020
Array Codes for Functional PIR and Batch Codes
A functional PIR array code is a coding scheme which encodes some s info...
research
∙
01/23/2020
The Capacity of Single-Server Weakly-Private Information Retrieval
A private information retrieval (PIR) protocol guarantees that a user ca...
research
∙
01/15/2020
The Error Probability of Maximum-Likelihood Decoding over Two Deletion Channels
This paper studies the problem of reconstructing a word given several of...
research
∙
01/14/2020
Partial MDS Codes with Local Regeneration
Partial MDS (PMDS) and sector-disk (SD) codes are classes of erasure cod...
research
∙
01/10/2020
PIR Codes with Short Block Length
In this work private information retrieval (PIR) codes are studied. In a...
research
∙
01/06/2020
Codes over Trees
In graph theory, a tree is one of the more popular families of graphs wi...
research
∙
01/06/2020
Coding for Sequence Reconstruction for Single Edits
The sequence reconstruction problem, introduced by Levenshtein in 2001, ...
research
∙
12/23/2019
Reconstruction of Strings from their Substrings Spectrum
This paper studies reconstruction of strings based upon their substrings...
research
∙
11/22/2019
Covering Codes for Insertions and Deletions
A covering code is a set of codewords with the property that the union o...
research
∙
09/12/2019
Repeat-Free Codes
In this paper we consider the problem of encoding data into repeat-free ...
research
∙
07/24/2019
Private Proximity Retrieval Codes
A private proximity retrieval (PPR) scheme is a protocol which allows a ...
research
∙
03/11/2019
Clustering-Correcting Codes
A new family of codes, called clustering-correcting codes, is presented ...
research
∙
01/21/2019
Anchor-Based Correction of Substitutions in Indexed Sets
Motivated by DNA-based data storage, we investigate a system where digit...
research
∙
01/20/2019
