Trading off coding complexity and feedback requirements for the packet erasure channel

We study the tradeoffs in employing two different approaches - coding and feedback - for reliable communication over packet erasure channels. Results are shown for a scheme that combines both approaches. Inspired by this scheme, we use rate distortion results to characterize the best achievable tradeoffs for a class of joint coding-and-feedback schemes.