Lower Bounds on the Deterministic and Quantum Communication Complexities of Hamming-Distance Problems

A sub-area of discrepancy theory that has received much attention in computer science re-cently, is that of explicit constructions of low-discrepancy point sets for various types of rectangle
families in high dimension. This research has led to interesting applications in error-control cod-
ing, distributed protocols, Web document filtering, derandomization, and other areas. We give
a short survey of this area here.