no code implementations • 25 Jan 2019 • Uri Hadar, Jingbo Liu, Yury Polyanskiy, Ofer Shayevitz
Our results also imply an $\Omega(n)$ lower bound on the information complexity of the Gap-Hamming problem, for which we show a direct information-theoretic proof.
no code implementations • 31 May 2018 • Uri Hadar, Ofer Shayevitz
We study a distributed estimation problem in which two remotely located parties, Alice and Bob, observe an unlimited number of i. i. d.