Another important technique for proving lower bounds in communication complexity comes from information theory. In Information Complexity and the Direct Sum Problem for Simultaneous Message Complexity (FOCS 2001), Chakrabarti, Shi, Wirth, and Yao introduced the notion of information complexity and used it to prove new lower bounds on the direct sum of the equality function. Follow-up work by Ba...