5 citations · 5 across the 2 of their papers we have counts for
2 papers
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…