2011/06/17 by Anas Chaaban, Aydin Sezgin, Chaaban, Anas +1
Computer Science · Engineering · Mathematics · #Cooperative Communication and Network Coding #FOS: Computer and information sciences #Full-Duplex Wireless Communications #Information Theory (cs.IT) #Wireless Communication Security Techniques #cs.IT #math.IT
paper · pdf · doi:10.48550/arxiv.1106.3402
to appear in ISIT 2011
arxiv created 2011/06/17 · openalex publication_date 2011/06/17 · arxiv updated 2015/03/19 · openalex created_date 2025/10/10 · openalex updated_date 2026/07/28
The linear shift deterministic Y-channel is studied. That is, we have three users and one relay, where each user wishes to broadcast one message to each other user via the relay, resulting in a multi-way relaying setup. The cut-set bounds for this setup are shown to be not sufficient to characterize its capacity region. New upper bounds are derived, which when combined with the cut-set bounds provide an outer bound on the capacity region. It is shown that this outer bound is achievable, and as a result, the capacity region of the linear shift deterministic Y-channel is characterized.