Erasure correction for nested receivers

We consider packet erasure or error correction coding for a nested receiver structure, where each receiver receives a subset of the packets received by the next receiver. This type of structure arises, for instance, with temporal demands, where each receiver corresponds to a deadline by which certain information must be decoded. By making a connection with our previous work on non-multicast network error correction, we find the capacity region for any given number of erasures or errors whose locations are a priori unknown, along with a capacity-achieving intra-session coding scheme.