Multiple-Input Multiple-Output Gaussian Broadcast Channels with Confidential Messages
| dc.creator | Liu, Ruoheng | |
| dc.creator | Liu, Tie | |
| dc.creator | Poor, H. Vincent | |
| dc.creator | Shamai, Shlomo | |
| dc.date | 2009-03-23 | |
| dc.date.accessioned | 2026-07-07T12:55:37Z | |
| dc.date.available | 2026-07-07T12:55:37Z | |
| dc.description | 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. | |
| dc.description | Submitted to the IEEE Transactions on Information Theory, March 2009 | |
| dc.identifier | https://arxiv.org/abs/0903.3786 | |
| dc.identifier | http://arxiv.org/abs/0903.3786 | |
| dc.identifier.uri | http://salesiana.dossiersoluciones.com/handle/123456789/224312 | |
| dc.subject | Information Theory | |
| dc.subject | Cryptography and Security | |
| dc.title | Multiple-Input Multiple-Output Gaussian Broadcast Channels with Confidential Messages | |
| dc.type | text |