2019/01/01 by Sung Hoon Lim, Chen Feng, Lim, Sung Hoon +7
Computer Science · Engineering · #Advanced Wireless Communication Technologies #Cooperative Communication and Network Coding #Error Correcting Code Techniques #FOS: Computer and information sciences #Information Theory (cs.IT) #Wireless Communication Security Techniques
paper · pdf · doi:10.48550/arxiv.1901.03274
openalex publication_date 2019/01/10 · openalex created_date 2022/07/30 · openalex updated_date 2026/07/28
Consider a receiver in a multi-user network that wishes to decode several\nmessages. Simultaneous joint typicality decoding is one of the most powerful\ntechniques for determining the fundamental limits at which reliable decoding is\npossible. This technique has historically been used in conjunction with random\ni.i.d. codebooks to establish achievable rate regions for networks. Recently,\nit has been shown that, in certain scenarios, nested linear codebooks in\nconjunction with "single-user" or sequential decoding can yield better\nachievable rates. For instance, the compute-forward problem examines the\nscenario of recovering L \≤ K linear combinations of transmitted codewords\nover a K-user multiple-access channel (MAC), and it is well established that\nlinear codebooks can yield higher rates. Here, we develop bounds for\nsimultaneous joint typicality decoding used in conjunction with nested linear\ncodebooks, and apply them to obtain a larger achievable region for\ncompute-forward over a K-user discrete memoryless MAC. The key technical\nchallenge is that competing codeword tuples that are linearly dependent on the\ntrue codeword tuple introduce statistical dependencies, which requires careful\npartitioning of the associated error events.\n