activity
20192022
most citedThe MMI Decoder is Asymptotically Optimal for the Typical Random Code and for the Expurgated Code

8 citations · 9 across the 4 of their papers we have counts for

collaborators

6 papers

cs.IT2022

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…

cs.IT20221 cited

Entropy Rate Bounds via Second-Order Statistics

Ran Tamir

This work contains two single-letter upper bounds on the entropy rate of a discrete-valued stationary stochastic process, which only depend on second-order statistics, and are prim…

cs.IT2020

Error Exponents in the Bee Identification Problem

Ran Tamir, Neri Merhav

We derive various error exponents in the bee identification problem under two different decoding rules. Under naïve decoding, which decodes each bee independently of the others, we…

cs.IT20208 cited

The MMI Decoder is Asymptotically Optimal for the Typical Random Code and for the Expurgated Code

Ran Tamir, Neri Merhav

We provide two results concerning the optimality of the maximum mutual information (MMI) decoder. First, we prove that the error exponents of the typical random codes under the opt…

cs.IT2020

Trade-offs Between Error Exponents and Excess-Rate Exponents of Typical Slepian-Wolf Codes

Ran Tamir, Neri Merhav

Typical random codes (TRC) in a communication scenario of source coding with side information at the decoder is the main subject of this work. We study the semi-deterministic code…

cs.IT2019

Large Deviations Behavior of the Logarithmic Error Probability of Random Codes

Ran Tamir, Neri Merhav, Nir Weinberger +1

This work studies the deviations of the error exponent of the constant composition code ensemble around its expectation, known as the error exponent of the typical random code (TRC…