Information Equals Amortized Communication

Details Information Equals Amortized Communication Information Equals Amortized Communication

2011-06-17

arxiv.org/abs/1106.3595v1

Computer Science

Information Theory

Scientific paper

We show how to efficiently simulate the sending of a message M to a receiver who has partial information about the message, so that the expected number of bits communicated in the simulation is close to the amount of additional information that the message reveals to the receiver. This is a generalization and strengthening of the Slepian-Wolf theorem, which shows how to carry out such a simulation with low amortized communication in the case that M is a deterministic function of X. A caveat is that our simulation is interactive. As a consequence, we prove that the internal information cost (namely the information revealed to the parties) involved in computing any relation or function using a two party interactive protocol is exactly equal to the amortized communication complexity of computing independent copies of the same relation or function. We also show that the only way to prove a strong direct sum theorem for randomized communication complexity is by solving a particular variant of the pointer jumping problem that we define. Our work implies that a strong direct sum theorem for communication complexity holds if and only if efficient compression of communication protocols is possible.

Affiliated with

Also associated with

No associations

Rating

Information Equals Amortized Communication does not yet have a rating. At this time, there are no reviews or comments for this scientific paper.

If you have personal experience with Information Equals Amortized Communication, we encourage you to share that experience with our LandOfFree.com community. Your opinion is very important and Information Equals Amortized Communication will most certainly appreciate the feedback.

Rate now

Comments { 0 }

Profile ID: LFWR-SCP-O-465319