2009/03/23 by Ruoheng Liu, Liu, Ruoheng, Tie Liu +5 · 1 citation
Computer Science · Engineering · Mathematics · #Advanced MIMO Systems Optimization #Cooperative Communication and Network Coding #Cryptography and Security (cs.CR) #FOS: Computer and information sciences #Information Theory (cs.IT) #Wireless Communication Security Techniques #cs.CR #cs.IT #math.IT
paper · pdf · doi:10.48550/arxiv.0903.3786
Submitted to the IEEE Transactions on Information Theory, March 2009
arxiv created 2009/03/23 · openalex publication_date 2009/03/23 · arxiv updated 2009/12/01 · openalex created_date 2025/10/10 · openalex updated_date 2026/07/28
This paper considers the problem of secret communication over a two-receiver multiple-input multiple-output (MIMO) Gaussian broadcast channel. The transmitter has two independent messages, each of which is intended for one of the receivers but needs to be kept asymptotically perfectly secret from the other. It is shown that, surprisingly, under a matrix power constraint both messages can be simultaneously transmitted at their respective maximal secrecy rates. To prove this result, the MIMO Gaussian wiretap channel is revisited and a new characterization of its secrecy capacity is provided via a new coding scheme that uses artificial noise and random binning.