Date Added: Jan 2010
The authors study a multicast extension of streaming bursterasure codes previously proposed for the single user setting. There are two receivers each interested in the common stream. Each receiver's channel however has a different burst parameter and likewise each receiver tolerates a different delay; both receivers are interested in a common stream. The authors develop two upper bounding approaches on the streaming multicast capacity. The first upper bound is developed by introducing an erasure channel that introduces periodic erasure bursts, which can corrected due to the multicast property. The second upper bound is based on information theoretic inequalities and is tight at the minimum delay point.