94 citations · 105 across the 6 of their papers we have counts for
Showing cs.ITShow all
3 papers · 1 filter
cs.IT2017★ 5 cited
On Binary Distributed Hypothesis Testing
Eli Haim, Yuval Kochman
We consider the problem of distributed binary hypothesis testing of two sequences that are generated by an i.i.d. doubly-binary symmetric source. Each sequence is observed by a dif…
cs.IT2013
The Importance of Tie-Breaking in Finite-Blocklength Bounds
Eli Haim, Yuval Kochman, Uri Erez
We consider upper bounds on the error probability in channel coding. We derive an improved maximum-likelihood union bound, which takes into account events where the likelihood of t…
cs.IT2012★ 5 cited
Distributed Structure: Joint Expurgation for the Multiple-Access Channel
Eli Haim, Yuval Kochman, Uri Erez
In this work we show how an improved lower bound to the error exponent of the memoryless multiple-access (MAC) channel is attained via the use of linear codes, thus demonstrating t…