Wasim Huleihel
Wasim Huleihel
Assistant Professor, Tel-Aviv University
Verified email at tauex.tau.ac.il - Homepage
Title
Cited by
Cited by
Year
Optimal adaptive waveform design for cognitive MIMO radar
W Huleihel, J Tabrikian, R Shavit
IEEE Transactions on Signal Processing 61 (20), 5075-5089, 2013
1262013
Reducibility and computational lower bounds for problems with planted sparse structure
M Brennan, G Bresler, W Huleihel
2018 Conference on Learning Theory, 48-166, 2018
592018
Why botnets work: Distributed brute-force attacks need no synchronization
S Salamatian, W Huleihel, A Beirami, A Cohen, M Médard
IEEE Transactions on Information Forensics and Security 14 (9), 2288-2299, 2019
35*2019
Universality of computational lower bounds for submatrix detection
M Brennan, G Bresler, W Huleihel
2019 Conference on Learning Theory, 417-468, 2019
152019
Centralized vs Decentralized Targeted Brute-Force Attacks: Guessing with Side-Information
S Salamatian, W Huleihel, A Beirami, A Cohen, M Médard
IEEE Transactions on Information Forensics and Security 15, 3749-3759, 2020
12*2020
Analysis of mismatched estimation errors using gradients of partition functions
W Huleihel, N Merhav
IEEE Transactions on Information Theory 60 (4), 2190-2216, 2014
122014
Channels with cooperation links that may be absent
W Huleihel, Y Steinberg
IEEE Transactions on Information Theory 63 (9), 5886-5906, 2017
112017
Same-cluster querying for overlapping clusters
W Huleihel, A Mazumdar, M Médard, S Pal
arXiv preprint arXiv:1910.12490, 2019
92019
Erasure/list random coding error exponents are not universally achievable
W Huleihel, N Weinberger, N Merhav
IEEE Transactions on Information Theory 62 (10), 5403-5421, 2016
92016
Random coding error exponents for the two-user interference channel
W Huleihel, N Merhav
IEEE Transactions on Information Theory 63 (2), 1019-1042, 2016
72016
Asymptotic MMSE analysis under sparse representation modeling
W Huleihel, N Merhav
Signal Processing 131, 320-332, 2017
62017
Universal decoding for gaussian intersymbol interference channels
W Huleihel, N Merhav
IEEE Transactions on Information Theory 61 (4), 1606-1618, 2015
62015
Asymptotic MMSE analysis under sparse representation modeling
W Huleihel, N Merhav
2014 IEEE International Symposium on Information Theory, 2634-2638, 2014
62014
How to quantize n outputs of a binary symmetric channel to n− 1 bits?
W Huleihel, O Ordentlich
2017 IEEE International Symposium on Information Theory (ISIT), 91-95, 2017
52017
Exact random coding error exponents for the two-user interference channel
W Huleihel, N Merhav
submitted to IEEE Trans. Inform. Theory, 2015
52015
On compressive sensing in coding problems: a rigorous approach
W Huleihel, N Merhav, S Shamai
IEEE Transactions on Information Theory 61 (10), 5727-5744, 2015
42015
Relaying one bit across a tandem of binary-symmetric channels
W Huleihel, Y Polyanskiy, O Shayevitz
2019 IEEE International Symposium on Information Theory (ISIT), 2928-2932, 2019
32019
Design of discrete constellations for peak-power-limited complex Gaussian channels
W Huleihel, Z Goldfeld, T Koch, M Madiman, M Médard
2018 IEEE International Symposium on Information Theory (ISIT), 556-560, 2018
32018
Variability in mRNA translation: a random matrix theory approach
M Margaliot, W Huleihel, T Tuller
Scientific Reports 11 (1), 1-14, 2021
22021
Codewords with memory improve achievable rate regions of the memoryless Gaussian interference channel
W Huleihel, N Merhav
arXiv preprint arXiv:1508.05726, 2015
22015
The system can't perform the operation now. Try again later.
Articles 1–20