1 citations · 1 across the 10 of their papers we have counts for
5 papers · 1 filter
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…
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…
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…