The Discrete Memoryless Multiple Access Channel with Confidential Messages

13 years 4 months ago

Download wsl.stanford.edu

A multiple-access channel is considered in which messages from one encoder are confidential. Confidential messages are to be transmitted with perfect secrecy, as measured by equivocation at the other encoder. The upper bounds and the achievable rates for this communication situation are determined.

Ruoheng Liu, Ivana Maric, Roy D. Yates, Predrag Sp

Real-time Traffic

Confidential Messages | CORR 2006 | Education | Encoder | Multiple-access Channel |

claim paper

» Multiple Access Channels with Generalized Feedback and Confidential Messages

» Compound Multiple Access Channels with Partial Cooperation

» Error Exponent for MultipleAccess ChannelsLower Bounds

» Rate Bounds for MIMO Relay Channels Using Message Splitting

» A New Upper Bound for a Binary Additive Noisy Multiple Access Channel with Feedback

» Outer Bounds for Multiple Access Channels with Feedback using Dependence Balance

» A New Upper Bound on the Average Error Exponent for MultipleAccess Channels

Post Info
More Details (n/a)

Added	11 Dec 2010
Updated	11 Dec 2010
Type	Journal
Year	2006
Where	CORR
Authors	Ruoheng Liu, Ivana Maric, Roy D. Yates, Predrag Spasojevic

Comments (0)

Sciweavers

The Discrete Memoryless Multiple Access Channel with Confidential Messages

Confidential Messages | CORR 2006 | Education | Encoder | Multiple-access Channel |

Explore & Download

Productivity Tools

Document Tools

Image Tools

Sciweavers