8 citations · 17 across the 8 of their papers we have counts for
Showing 2020Show all
3 papers · 1 filter
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.IT2020★ 8 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…