| 1. |
- Ghasemi-Goojani, Shahab, et al.
(author)
-
On the Capacity of State-Dependent Gaussian Z-Interference Channel
- 2019
-
In: Proceedings of 2018 International Symposium on Information Theory and Its Applications, ISITA 2018. - : Institute of Electrical and Electronics Engineers Inc.. - 9784885523182 ; , s. 653-657
-
Conference paper (peer-reviewed)abstract
- We study the State-Dependent Gaussian Z-Interference Channel (SDG-ZIC), with two senders transmitting two independent messages through a Gaussian Z-interference channel with the same state. Transmitter 1 interferes with receiver 2, while transmitter 2 does not interfere with receiver 1. In addition, both receivers suffer from the same but differently scaled random state sequence, which is non-causally known at both transmitters. As mentioned in [1], the challenge here is to fully cancel differently scaled states at both receivers. Proposing transmission schemes based on nested lattice codes, we show that under some new conditions, the state at both receivers can be fully canceled and the capacity region can be fully achieved.
|
|
| 2. |
- Ghasemi-Goojani, Shahab, et al.
(author)
-
The Symmetric Two-Hop Channel with an Untrusted Relay
- 2019
-
In: Proceedings of 2018 International Symposium on Information Theory and Its Applications, ISITA 2018. - : Institute of Electrical and Electronics Engineers Inc.. - 9784885523182 ; , s. 673-677
-
Conference paper (peer-reviewed)abstract
- We study, using information-theoretic security methods, the so-called symmetric two-hop channel with an untrusted relay. In this model, a source wants to send its message reliably and securely to the destination through an honest but curious relay. The relay acts as a passive eavesdropper. Our investigation, in line with the relevant literature, seeks to determine what rate, termed secrecy rate, is achievable. To do that, we consider a typical setting, with the destination cooperating with the source, sending a 'scrambling' signal to conceal the message from the relay. To derive the achievable secrecy rate, we propose a novel scheme based on nested lattice codes. We show that our scheme outperforms all existing schemes and it achieves the outer bound for this channel model within 0.33 bits.
|
|
