The Discrete Memoryless Multiple Access Channel with Confidential Messages
classification
💻 cs.IT
math.IT
keywords
confidentialmessageschannelencoderaccessachievableboundscommunication
read the original abstract
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.
This paper has not been read by Pith yet.
discussion (0)
Sign in with ORCID, Apple, or X to comment. Anyone can read and Pith papers without signing in.