Show that the expected number of packets Alice must send until Bob has enough to decode all n messages is at most 8 n for sufficiently large n. Remember that \frac{1}{2} of the messages are lost.
Show that the expected number of packets Alice must send until Bob has enough to decode all n messages is at most 8 n for sufficiently large n. Remember that \frac{1}{2} of the messages are lost.