The Discrete Memoryless Multiple Access Channel with Confidential Messages
Ruoheng Liu, Ivana Maric, Roy D. Yates, Predrag Spasojevic
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.
Create a lesson
Related papers
An Approach to Asynchronous Unsourced Random Access
Alireza Karami, Dmitry Trukhachev
Local Private Information Retrieval for Graph-Based Replicated Systems
Shreya Meel, Mohamed Nomeir, Sennur Ulukus
Semantic Freshness Optimal Sampling and Transmission for Gossiping Receivers
Irtiza Hasan, Ahmed Arafa
Minimax bounds for watermarked and masked recursive discrete distribution estimation
Millen Kanabar, Michael Gastpar
Fast Fault-Tolerant Decoders for Hypergraph Product and Lifted-Product Codes
Asit Kumar Pradhan, Nithin Raveendran, David Declercq et al.
Asymptotic Bounds on Generalized Covering Radii of Binary Primitive BCH Codes
Maosheng Xiong, Chi Hoi Yip, Ferdinando Zullo