Computer Science – Information Theory
Scientific paper
2010-10-12
Computer Science
Information Theory
8 pages, 2 figures. Published in Allerton 2010. The journal version of this work was submitted to IEEE Trans IT in May, 2010
Scientific paper
This paper focuses on the 1-to-K broadcast packet erasure channel (PEC), which is a generalization of the broadcast binary erasure channel from the binary symbol to that of arbitrary finite fields GF(q) with sufficiently large q. We consider the setting in which the source node has instant feedback of the channel outputs of the K receivers after each transmission. Such a setting directly models network coded packet transmission in the downlink direction with integrated feedback mechanisms (such as Automatic Repeat reQuest (ARQ)). The main results of this paper are: (i) The capacity region for general 1-to-3 broadcast PECs, and (ii) The capacity region for two classes of 1-to-K broadcast PECs: the symmetric PECs, and the spatially independent PECs with one-sided fairness constraints. This paper also develops (iii) A pair of outer and inner bounds of the capacity region for arbitrary 1-to-K broadcast PECs, which can be evaluated by any linear programming solver. For most practical scenarios, the outer and inner bounds meet and thus jointly characterize the capacity.
No associations
LandOfFree
Capacity of 1-to-K Broadcast Packet Erasure Channels with Channel Output Feedback does not yet have a rating. At this time, there are no reviews or comments for this scientific paper.
If you have personal experience with Capacity of 1-to-K Broadcast Packet Erasure Channels with Channel Output Feedback, we encourage you to share that experience with our LandOfFree.com community. Your opinion is very important and Capacity of 1-to-K Broadcast Packet Erasure Channels with Channel Output Feedback will most certainly appreciate the feedback.
Profile ID: LFWR-SCP-O-608724