Computer Science – Information Theory
Scientific paper
2006-12-18
Computer Science
Information Theory
Presented at the 44th Annual Allerton Conference on Communication, Control, and Computing, September 27-29, 2006
Scientific paper
We consider the General Gaussian Multiple Access Wire-Tap Channel (GGMAC-WT). In this scenario, multiple users communicate with an intended receiver in the presence of an intelligent and informed eavesdropper who is as capable as the intended receiver, but has different channel parameters. We aim to provide perfect secrecy for the transmitters in this multi-access environment. Using Gaussian codebooks, an achievable secrecy region is determined and the power allocation that maximizes the achievable sum-rate is found. Numerical results showing the new rate region are presented. It is shown that the multiple-access nature of the channel may be utilized to allow users with zero single-user secrecy capacity to be able to transmit in perfect secrecy. In addition, a new collaborative scheme is shown that may increase the achievable sum-rate. In this scheme, a user who would not transmit to maximize the sum rate can help another user who (i) has positive secrecy capacity to increase its rate, or (ii) has zero secrecy capacity to achieve a positive secrecy capacity.
Tekin Ender
Yener Aylin
No associations
LandOfFree
Achievable Rates for the General Gaussian Multiple Access Wire-Tap Channel with Collective Secrecy does not yet have a rating. At this time, there are no reviews or comments for this scientific paper.
If you have personal experience with Achievable Rates for the General Gaussian Multiple Access Wire-Tap Channel with Collective Secrecy, we encourage you to share that experience with our LandOfFree.com community. Your opinion is very important and Achievable Rates for the General Gaussian Multiple Access Wire-Tap Channel with Collective Secrecy will most certainly appreciate the feedback.
Profile ID: LFWR-SCP-O-5063