52 citations · 520 across the 129 of their papers we have counts for
6 papers · 1 filter
A Universal Random Coding Ensemble for Sample-wise Lossy Compression
Neri Merhav
We propose a universal ensemble for random selection of rate-distortion codes, which is asymptotically optimal in a sample-wise sense. According to this ensemble, each reproduction…
The Secrecy Capacity of The Gaussian Wiretap Channel with Rate-Limited Help
Sergey Loyka, Neri Merhav
The Gaussian wiretap channel with rate-limited help, available at the legitimate receiver (Rx) or/and transmitter (Tx), is studied under various channel configurations (degraded, r…
Codebook Mismatch Can Be Fully Compensated by Mismatched Decoding
Neri Merhav, Georg Bocherer
We consider an ensemble of constant composition codes that are subsets of linear codes: while the encoder uses only the constant-composition subcode, the decoder operates as if the…
Error Exponents of the Dirty-Paper and Gel'fand-Pinsker Channels
Ran Tamir, Neri Merhav
We derive various error exponents for communication channels with random states, which are available non-causally at the encoder only. For both the finite-alphabet Gel'fand-Pinsker…
-semifaithful codes that are universal over both memoryless sources and distortion measures
Neri Merhav
We prove the existence of codebooks for d-semifaithful lossy compression that are simultaneously universal with respect to both the class of finite-alphabet memoryless sources and…
Optimal Correlators and Waveforms for Mismatched Detection
Neri Merhav
We consider the classical Neymann-Pearson hypothesis testing problem of signal detection, where under the null hypothesis ($\calH_0$), the received signal is white Gaussian noise,…