English (United Kingdom)

https://curated-unify.zendy.io/wp-json/zendy-region/v1/featured_content/oa?rat=en

https://curated-unify.zendy.io/wp-json/zendy-region/v1/highlighted_journal/

Global: Zendy Tools annual

Presents the keyphrase highlighting as premium feature

Keyphrase Highlighting

Presents the summarisation as premium feature

Summarisation

Insights

Presents the pdf analysis as premium feature

PDF Analysis

Presents the zaia usage as premium feature

ZAIA

Global: Zendy Tools monthly

Global: Zendy Plus monthly

Presents the access of premium content as premium feature

Premium Content

Global: Zendy Plus annual

Global: Zendy Free Plan

This paper focuses on the 1-to-K broadcast packet erasure channel (PEC),which is a generalization of the broadcast binary erasure channel from thebinary symbol to that of arbitrary finite fields GF(q) with sufficiently largeq. We consider the setting in which the source node has instant feedback of thechannel outputs of the K receivers after each transmission. The capacity regionof the 1-to-K PEC with COF was previously known only for the case K=2. Such asetting directly models network coded packet transmission in the downlinkdirection with integrated feedback mechanisms (such as Automatic Repeat reQuest(ARQ)).  The main results of this paper are: (i) The capacity region for general1-to-3 broadcast PECs, and (ii) The capacity region for two types of 1-to-$K$broadcast PECs: the symmetric PECs, and the spatially independent PECs withone-sided fairness constraints. This paper also develops (iii) A pair of outerand inner bounds of the capacity region for arbitrary 1-to-K broadcast PECs,which can be easily evaluated by any linear programming solver. The proposedinner bound is proven by a new class of intersession network coding schemes,termed the packet evolution schemes, which is based on the concept of codealignment in GF(q) that is in parallel with the interference alignmenttechniques for the Euclidean space. Extensive numerical experiments show thatthe outer and inner bounds meet for almost all broadcast PECs encountered inpractical scenarios and thus effectively bracket the capacity of general 1-to-Kbroadcast PECs with COF.

Capacity of 1-to-K Broadcast Packet Erasure Channels with Channel Output Feedback (Full Version)