2013/10/07 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.1310.1732
submitted to IEEE Transactions on Information Theory
arxiv created 2013/10/07 · openalex publication_date 2013/10/07 · arxiv updated 2013/10/08 · openalex created_date 2025/10/10 · openalex updated_date 2026/07/28
A full-duplex wireless network with three users that want to establish full message-exchange via a relay is considered. Thus, the network known as the Y-channel has a total of 6 messages, 2 outgoing and 2 incoming at each user. The users are not physically connected, and thus the relay is essential for their communication. The linear-shift deterministic Y-channel is considered first, its capacity region is characterized and shown not to be given by the cut-set bounds. The capacity achieving scheme has three different components (strategies): a bi-directional, a cyclic, and a uni-directional strategy. Network coding is used to realize the bi-directional and the cyclic strategies, and thus to prove the achievability of the capacity region. The result is then extended to the Gaussian Y-channel where the capacity region is characterized within a constant gap independent of the channel parameters.