2021/03/05 by Touheed Anwar Atif, Atif, Touheed Anwar, Arun Padakandla +3
Biochemistry, Genetics and Molecular Biology · Computer Science · Mathematics · Physics and Astronomy · #DNA and Biological Computing #FOS: Computer and information sciences #FOS: Physical sciences #Information Theory (cs.IT) #Quantum Computing Algorithms and Architecture #Quantum Physics (quant-ph) #Quantum-Dot Cellular Automata #cs.IT #math.IT #quant-ph
paper · pdf · doi:10.48550/arxiv.2103.03978
18 pages. arXiv admin note: text overlap with arXiv:2103.02082
arxiv created 2021/03/05 · openalex publication_date 2021/03/05 · arxiv updated 2021/03/09 · openalex created_date 2022/09/30 · openalex updated_date 2026/08/04
We consider the problem of characterizing an inner bound to the capacity region of a 3-user classical-quantum interference channel (3-CQIC). The best known coding scheme for communicating over CQICs is based on unstructured random codes and employs the techniques of message splitting and superposition coding. For classical 3-user interference channels (ICs), it has been proven that coding techniques based on coset codes - codes possessing algebraic closure properties - strictly outperform all coding techniques based on unstructured codes. In this work, we develop analogous techniques based on coset codes for 3to1-CQICs - a subclass of 3-user CQICs. We analyze its performance and derive a new inner bound to the capacity region of 3to1-CQICs that subsume the current known largest and strictly enlarges the same for identified examples.