We prove an optimal (n) lower bound on the randomized communication complexity of the much-studied GAP-HAMMING-DISTANCE problem. As a consequence, we obtain essentially optimal mu...
We investigate the problem of local reconstruction, as defined by Saks and Seshadhri (2008), in the context of error correcting codes. The first problem we address is that of me...