1 citations · 1 across the 10 of their papers we have counts for
13 papers
Universal recovery in approximate quantum error correction
Dor Elimelech, Victor V. Albert, Alexander Barg
Universal recovery -- the existence of a single recovery map that corrects an entire family of error channels -- is a central feature of quantum error correction (QEC). In exact QE…
Theory of approximate quantum error correction and the error-set model
Dor Elimelech, Victor V. Albert, Alexander Barg
We develop a theory of approximate quantum error correction (QEC) based on the error-set model, complemented by general methods for code construction. Exact QEC has a powerful erro…
Asymptotically good bosonic Fock state codes
Dor Elimelech, Arda Aydin, Alexander Barg
We study the error-correction properties of multi-mode Fock-state codes under amplitude-damping (AD) noise, focusing on the asymptotic regime in which the total excitation of the c…
Robust Detection of Planted Subgraphs in Semi-Random Models
Dor Elimelech, Wasim Huleihel
Detection of planted subgraphs in Erdös-Rényi random graphs has been extensively studied, leading to a rich body of results characterizing both statistical and computational thresh…
Detecting Arbitrary Planted Subgraphs in Random Graphs
Dor Elimelech, Wasim Huleihel
The problems of detecting and recovering planted structures/subgraphs in Erdős-Rényi random graphs, have received significant attention over the past three decades, leading to many…
Detection of Correlated Random Vectors
Dor Elimelech, Wasim Huleihel
In this paper, we investigate the problem of deciding whether two standard normal random vectors and are correlated or n…
Quantized-Constraint Concatenation and the Covering Radius of Constrained Systems
Dor Elimelech, Tom Meyerovitch, Moshe Schwartz
We introduce a novel framework for implementing error-correction in constrained systems. The main idea of our scheme, called Quantized-Constraint Concatenation (QCC), is to employ…
Phase Transitions in the Detection of Correlated Databases
Dor Elimelech, Wasim Huleihel
We study the problem of detecting the correlation between two Gaussian databases and , each composed of users with…
The Second-Order Football-Pool Problem and the Optimal Rate of Generalized-Covering Codes
Dor Elimelech, Moshe Schwartz
The goal of the classic football-pool problem is to determine how many lottery tickets are to be bought in order to guarantee at least correct guesses out of a sequence of $n…
On the Generalized Covering Radii of Reed-Muller Codes
Dor Elimelech, Hengjia Wei, Moshe Schwartz
We study generalized covering radii, a fundamental property of linear codes that characterizes the trade-off between storage, latency, and access in linear data-query protocols suc…
The Generalized Covering Radii of Linear Codes
Dor Elimelech, Marcelo Firer, Moshe Schwartz
Motivated by an application to database linear querying, such as private information-retrieval protocols, we suggest a fundamental property of linear codes -- the generalized cover…
Permutations with restricted movement
Dor Elimelech
A restricted permutation of a locally finite directed graph is a vertex permutation for which , for any vertex . The set of such permut…
Master's thesis: Permutations With Restricted Movement
Dor Elimelech
We study restricted permutations of sets which have a geometrical structure. The study of restricted permutations is motivated by their application in coding for flash memories, an…