31 citations · 59 across the 37 of their papers we have counts for
18 papers · 1 filter
Recovery of Planted Subgraphs
Wasim Huleihel
Understanding the fundamental limits of recovering planted subgraphs in random graphs is a central challenge in high-dimensional statistics and theoretical computer science. While…
Testing for a Hidden Geometry in Random Graphs
Amit Silber, Mor Oren-Loberman, Wasim Huleihel
We study the problem of detecting a faint geometric signal hidden in an otherwise random graph. Formally, we consider a hypothesis testing problem in which, under the null, the obs…
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…
Detection and Recovery of Hidden Submatrices
Marom Dadon, Wasim Huleihel, Tamir Bendory
In this paper, we study the problems of detection and recovery of hidden submatrices with elevated means inside a large Gaussian random matrix. We consider two different structures…
Optimal Reference for DNA Synthesis
Ohad Elishco, Wasim Huleihel
In the recent years, DNA has emerged as a potentially viable storage technology. DNA synthesis, which refers to the task of writing the data into DNA, is perhaps the most costly pa…
Centralized vs Decentralized Targeted Brute-Force Attacks: Guessing with Side-Information
Salman Salamatian, Wasim Huleihel, Ahmad Beirami +2
According to recent empirical studies, a majority of users have the same, or very similar, passwords across multiple password-secured online services. This practice can have disast…
Why Botnets Work: Distributed Brute-Force Attacks Need No Synchronization
Salman Salamatian, Wasim Huleihel, Ahmad Beirami +2
In September 2017, McAffee Labs quarterly report estimated that brute force attacks represent 20\% of total network attacks, making them the most prevalent type of attack ex-aequo…
Channels with Cooperation Links that May Be Absent
Wasim Huleihel, Yossef Steinberg
It is well known that cooperation between users in a communication network can lead to significant performance gains. A common assumption in past works is that all the users are aw…
Gaussian Intersymbol Interference Channels With Mismatch
Wasim Huleihel, Salman Salamatian, Neri Merhav +1
This paper considers the problem of channel coding over Gaussian intersymbol interference (ISI) channels with a given metric decoding rule. Specifically, it is assumed that the mis…
How to Quantize Outputs of a Binary Symmetric Channel to Bits?
Wasim Huleihel, Or Ordentlich
Suppose that is obtained by observing a uniform Bernoulli random vector through a binary symmetric channel with crossover probability . The "most informative Boolean…
Codewords With Memory Improve Achievable Rate Regions of the Memoryless Gaussian Interference Channel
Wasim Huleihel, Neri Merhav
The two-user Gaussian interference channel (GIC) has been extensively studied in the literature during the last four decades. The full characterization of the capacity region of th…
Random Coding Error Exponents for the Two-User Interference Channel
Wasim Huleihel, Neri Merhav
This paper is about deriving lower bounds on the error exponents for the two-user interference channel under the random coding regime for several ensembles. Specifically, we first…
Erasure/List Random Coding Error Exponents Are Not Universally Achievable
Wasim Huleihel, Nir Weinberger, Neri Merhav
We study the problem of universal decoding for unknown discrete memoryless channels in the presence of erasure/list option at the decoder, in the random coding regime. Specifically…
On Compressive Sensing in Coding Problems: A Rigorous Approach
Wasim Huleihel, Neri Merhav, Shlomo Shamai
We take an information theoretic perspective on a classical sparse-sampling noisy linear model and present an analytical expression for the mutual information, which plays central…
Universal Decoding for Gaussian Intersymbol Interference Channels
Wasim Huleihel, Neri Merhav
A universal decoding procedure is proposed for the intersymbol interference (ISI) Gaussian channels. The universality of the proposed decoder is in the sense of being independent o…
Asymptotic MMSE Analysis Under Sparse Representation Modeling
Wasim Huleihel, Neri Merhav
Compressed sensing is a signal processing technique in which data is acquired directly in a compressed form. There are two modeling approaches that can be considered: the worst-cas…
Analysis of Mismatched Estimation Errors Using Gradients of Partition Functions
Wasim Huleihel, Neri Merhav
We consider the problem of signal estimation (denoising) from a statistical-mechanical perspective, in continuation to a recent work on the analysis of mean-square error (MSE) esti…