Ambainis A, Gasarch W, Srinivasan A, Utis A.  2006.  Lower Bounds on the Deterministic and Quantum Communication Complexities of Hamming-Distance Problems. Algorithms and ComputationAlgorithms and Computation. 4288:628-637.