Let (t, k) be as in Exercise 6.6.17, and let g(w, k) be the smallest integer t

Let β(t, k) be as in Exercise 6.6.17, and let g(w, k) be the smallest integer t such that β(t, k) ≥ x. Prove that r(w, k) = g(w, k). Prove that any solution protocol using k + 1 reliable bits to communicate values from U requires

Transcribed Image Text:

i+k-1 (i ) 2k+1 k-1 g(U, k)+k k time on the average.