
EnduranceLimited Memories: Capacity and Codes
Resistive memories, such as phase change memories and resistive random a...
read it

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...
read it

Multistrand Reconstruction from Substrings
The problem of string reconstruction based on its substrings spectrum ha...
read it

On the Size of Levenshtein Balls
The rapid development of DNA storage has brought the deletion and insert...
read it

FunctionCorrecting Codes
Motivated by applications in machine learning and archival data storage,...
read it

Multiple CrissCross DeletionCorrecting Codes
This paper investigates the problem of correcting multiple crisscross d...
read it

The Zero Cubes Free and Cubes Unique Multidimensional Constraints
This paper studies two families of constraints for twodimensional and m...
read it

Correctable Erasure Patterns in Product Topologies
Locality enables storage systems to recover failed nodes from small subs...
read it

Almost Optimal Construction of Functional Batch Codes Using Hadamard Codes
A functional kbatch code of dimension s consists of n servers storing l...
read it

Partial MDS Codes with Regeneration
Partial MDS (PMDS) and sectordisk (SD) codes are classes of erasure cor...
read it

MultiServer WeaklyPrivate Information Retrieval
Private information retrieval (PIR) protocols ensure that a user can dow...
read it

SingleDeletion SingleSubstitution Correcting Codes
Correcting insertions/deletions as well as substitution errors simultane...
read it

Constrained de Bruijn Codes: Properties, Enumeration, Constructions, and Applications
The de Bruijn graph, its sequences, and their various generalizations, h...
read it

CrissCross Deletion Correcting Codes
This paper studies the problem of constructing codes correcting deletion...
read it

Optimal Reconstruction Codes for Deletion Channels
The sequence reconstruction problem, introduced by Levenshtein in 2001, ...
read it

Array Codes for Functional PIR and Batch Codes
A functional PIR array code is a coding scheme which encodes some s info...
read it

The Capacity of SingleServer WeaklyPrivate Information Retrieval
A private information retrieval (PIR) protocol guarantees that a user ca...
read it

The Error Probability of MaximumLikelihood Decoding over Two Deletion Channels
This paper studies the problem of reconstructing a word given several of...
read it

Partial MDS Codes with Local Regeneration
Partial MDS (PMDS) and sectordisk (SD) codes are classes of erasure cod...
read it

PIR Codes with Short Block Length
In this work private information retrieval (PIR) codes are studied. In a...
read it

Codes over Trees
In graph theory, a tree is one of the more popular families of graphs wi...
read it

Coding for Sequence Reconstruction for Single Edits
The sequence reconstruction problem, introduced by Levenshtein in 2001, ...
read it

Reconstruction of Strings from their Substrings Spectrum
This paper studies reconstruction of strings based upon their substrings...
read it

Covering Codes for Insertions and Deletions
A covering code is a set of codewords with the property that the union o...
read it

RepeatFree Codes
In this paper we consider the problem of encoding data into repeatfree ...
read it

Private Proximity Retrieval Codes
A private proximity retrieval (PPR) scheme is a protocol which allows a ...
read it

ClusteringCorrecting Codes
A new family of codes, called clusteringcorrecting codes, is presented ...
read it

AnchorBased Correction of Substitutions in Indexed Sets
Motivated by DNAbased data storage, we investigate a system where digit...
read it

WeaklyPrivate Information Retrieval
Private information retrieval (PIR) protocols make it possible to retrie...
read it

Iterative Programming of Noisy Memory Cells
In this paper, we study a model, which was first presented by Bunte and ...
read it

Bounds on the Length of Functional PIR and Batch codes
A functional kPIR code of dimension s consists of n servers storing lin...
read it

Private Information Retrieval in Graph Based Replication Systems
In a Private Information Retrieval (PIR) protocol, a user can download a...
read it

Double and Triple NodeErasureCorrecting Codes over Graphs
In this paper we study arraybased codes over graphs for correcting mult...
read it

Double and Triple ErasureCorrectingCodes over Graphs
In this paper we study arraybased codes over graphs for correcting mult...
read it

Mutually Uncorrelated Codes for DNA Storage
Mutually Uncorrelated (MU) codes are a class of codes in which no proper...
read it

On the Access Complexity of PIR Schemes
Private information retrieval has been reformulated in an informationth...
read it

Coding over Sets for DNA Storage
In this paper we study errorcorrecting codes for the storage of data in...
read it

DuplicationCorrecting Codes
In this work, we propose constructions that correct duplications of mult...
read it
Eitan Yaakobi
is this you? claim profile