The platform will undergo maintenance on Sep 14 at about 7:45 AM EST and will be unavailable for approximately 2 hours.
2019
DOI: 10.1109/tifs.2019.2894370
|View full text |Cite
|
Sign up to set email alerts
|

Maximizing the Minimum Achievable Secrecy Rate for a Two-User Gaussian Weak Interference Channel

Help me understand this report

Search citation statements

Order By: Relevance

Paper Sections

Select...
4
1

Citation Types

0
5
0

Year Published

2021
2021
2023
2023

Publication Types

Select...
2
2

Relationship

0
4

Authors

Journals

citations
Cited by 4 publications
(5 citation statements)
references
References 24 publications
0
5
0
Order By: Relevance
“…In conclusion, the function value is increasing throughout the fixed point iteration (35) and it has an upper bound. Therefore, the fixed point iteration (35) is bound to converge.…”
Section: Appendix B Proof Of Theoremmentioning
confidence: 83%
See 4 more Smart Citations
“…In conclusion, the function value is increasing throughout the fixed point iteration (35) and it has an upper bound. Therefore, the fixed point iteration (35) is bound to converge.…”
Section: Appendix B Proof Of Theoremmentioning
confidence: 83%
“…In this paper, similar to [35], we aim to maximize the worstcase secrecy rate of multiple users for guaranteeing user fairness in terms of the achievable secrecy performance. In particular, the minimum secrecy rate (Bits/s/Hz) of the K users is…”
Section: System Model and Problem Statement A System Modelmentioning
confidence: 99%
See 3 more Smart Citations