## The One-Way Communication Complexity of Hamming Distance

- T. S. Jayram, Ravi Kumar, D. Sivakumar
- Theory of Computing
- 2008

- Published 2015

Recall from last lecture the simple but useful model of one-way communication complexity. Alice has an input x ∈ {0, 1}, Bob has an input y ∈ {0, 1}, and the goal is to compute a Boolean function f : {0, 1} × {0, 1} → {0, 1} of the joint input (x,y). The players communicate as in Figure ??: Alice sends a message z to Bob as a function of x only (she doesn’t… CONTINUE READING

### Presentations referencing similar topics