Let (t, k) denote the size of the largest set for which the two-party communication problem can

Let β(t, k) denote the size of the largest set for which the two-party communication problem can always be solved transmitting k + 1 reliable bits and at most t additional time units. Prove that

Transcribed Image Text:

B(t, k) = 2k+1 t+k k