Name
Abstract | ||
|---|---|---|
Interference channels with confidential messages are studied under strong secrecy constraints, based on the framework of channel resolvability theory. It is shown that if the random binning rate for securing a confidential message is above the resolution of its corresponding wiretapped channel, strong secrecy can be guaranteed. The information-spectrum method introduced by Han and Verdú is general... |
Year | DOI | Venue |
|---|---|---|
2018 | 10.1109/TIT.2018.2834508 | IEEE Transactions on Information Theory |
Keywords | Field | DocType |
Interference channels,Receivers,Electrical engineering,Electronic mail,Encoding,Probability,Transmitters | Discrete mathematics,Topology,Computer science,Secrecy,Communication channel,Interference (wave propagation),Gaussian interference,Encoding (memory) | Journal |
Volume | Issue | ISSN |
64 | 7 | 0018-9448 |
Citations | PageRank | References |
1 | 0.35 | 0 |
Authors | ||
5 | ||
Name | Order | Citations | PageRank |
|---|---|---|---|
| Zhao Wang | 1 | 15 | 3.43 |
| Rafael F. Schaefer | 2 | 165 | 35.85 |
| Mikael Skoglund | 3 | 1397 | 175.71 |
| Ming Xiao | 4 | 188 | 24.86 |
| H. V. Poor | 5 | 25411 | 1951.66 |