The Discrete Memoryless Multiple Access Channel with Confidential Messages
| dc.creator | Liu, Ruoheng | |
| dc.creator | Maric, Ivana | |
| dc.creator | Yates, Roy D. | |
| dc.creator | Spasojevic, Predrag | |
| dc.date | 2006-05-01 | |
| dc.date | 2007-02-17 | |
| dc.date.accessioned | 2026-07-07T08:16:31Z | |
| dc.date.available | 2026-07-07T08:16:31Z | |
| dc.description | 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. | |
| dc.description | 1 figure, accepted by ISIT 2006 conference | |
| dc.identifier | https://arxiv.org/abs/cs/0605005 | |
| dc.identifier | http://arxiv.org/abs/cs/0605005 | |
| dc.identifier.uri | http://salesiana.dossiersoluciones.com/handle/123456789/133806 | |
| dc.subject | Information Theory | |
| dc.title | The Discrete Memoryless Multiple Access Channel with Confidential Messages | |
| dc.type | text |