52 citations · 520 across the 129 of their papers we have counts for
147 papers
Universal Random Coding for Successive Refinement of Individual Sequences Based on Lempel-Ziv Complexity
Neri Merhav
This work extends an earlier proposed universal random-coding ensemble for sample-wise lossy compression of individual sequences to the two-stage (successive-refinement) setting --…
Statistics of the Compression Ratio of a Variable-to-Variable Code: Exact Moments and Asymptotic Behavior
Neri Merhav
A variable-to-variable (V2V) length code parses a source sequence into phrases of variable length and maps each phrase to a binary codeword of, generally, a different random length…
Grouped Reverse Importance Sampling for the Partition Function
Neri Merhav
We introduce and analyze several grouped variants of the method of reverse importance sampling (RIS) for estimating a partition function from samples of the Boltzmann distribution…
Soft Covering via Hypothesis Testing: Typical-Code Exponents and Mismatched Detection
Neri Merhav
We study the typical-code (quenched) behavior of the false-alarm (FA) and missed-detection (MD) error exponents of the Neyman-Pearson test associated with soft covering, complement…
Soft Covering Through the Lens of Hypothesis Testing
Neri Merhav
We study the soft covering phenomenon through the lens of Neyman--Pearson hypothesis testing: given a channel output sequence , can one decide whether it was produced when the…
A Statistical-Physics Refinement of Soft Covering
Neri Merhav
We study the channel output distribution induced by a rate- random code via statistical physics. The partition function is $Z_n(β|\mathcal{C}) = \sum_{y^n}[P_{Y^n|\mathcal{C}}(y…