Name
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 |
Year | DOI | Venue |
|---|---|---|
2006 | 10.1109/ISIT.2006.261801 | Seattle, WA |
Keywords | Field | DocType |
upper bound | Broadcasting,Confidentiality,Upper and lower bounds,Computer science,Computer network,Communication channel,Probability distribution,Encoder,Information-theoretic security,Equivocation | Journal |
Volume | ISBN | Citations |
abs/cs/060 | 1-4244-0504-1 | 55 |
PageRank | References | Authors |
6.72 | 3 | 4 |
Name | Order | Citations | PageRank |
|---|---|---|---|
| Ruoheng Liu | 1 | 708 | 48.20 |
| Ivana Marić | 2 | 1904 | 104.95 |
| Roy D. Yates | 3 | 1889 | 266.12 |
| Predrag Spasojevic | 4 | 427 | 51.42 |