52 citations · 520 across the 129 of their papers we have counts for
5 papers · 1 filter
Refinements and Generalizations of the Shannon Lower Bound via Extensions of the Kraft Inequality
Neri Merhav
We derive a few extended versions of the Kraft inequality for lossy compression, which pave the way to the derivation of several refinements and extensions of the well known Shanno…
Volume-Based Lower Bounds to the Capacity of the Gaussian Channel Under Pointwise Additive Input Constraints
Neri Merhav, Shlomo Shamai
We present a family of relatively simple and unified lower bounds on the capacity of the Gaussian channel under a set of pointwise additive input constraints. Specifically, the adm…
Lempel-Ziv Complexity, Empirical Entropies, and Chain Rules
Neri Merhav
We derive upper and lower bounds on the overall compression ratio of the 1978 Lempel-Ziv (LZ78) algorithm, applied independently to -blocks of a finite individual sequence. Both…
Universal Encryption of Individual Sequences Under Maximal Leakage
Neri Merhav
We consider the Shannon cipher system in the framework of individual sequences and finite-state encrypters under the metric of maximal leakage of information. A lower bound and an…
Successive Refinement for Lossy Compression of Individual Sequences
Neri Merhav
We consider the problem of successive-refinement coding for lossy compression of individual sequences, namely, compression in two stages, where in the first stage, a coarse descrip…