default search action
S. Ali A. Fakoorian
Person information
Refine list
refinements active!
zoomed in on ?? of ?? records
view refined list in
export refined list as
2010 – 2019
- 2014
- [j6]Amitav Mukherjee, S. Ali A. Fakoorian, Jing Huang, A. Lee Swindlehurst
:
Principles of Physical Layer Security in Multiuser Wireless Networks: A Survey. IEEE Commun. Surv. Tutorials 16(3): 1550-1573 (2014) - [c7]Daohua Zhu, A. Lee Swindlehurst
Device-to-device communications: The physical layer security advantage. ICASSP 2014: 1606-1610 - 2013
- [j5]S. Ali A. Fakoorian, A. Lee Swindlehurst
On the Optimality of Linear Precoding for Secrecy in the MIMO Broadcast Channel. IEEE J. Sel. Areas Commun. 31(9): 1701-1713 (2013) - [j4]S. Ali A. Fakoorian, A. Lee Swindlehurst
Competing for Secrecy in the MISO Interference Channel. IEEE Trans. Signal Process. 61(1): 170-181 (2013) - [j3]S. Ali A. Fakoorian, A. Lee Swindlehurst
Full Rank Solutions for the MIMO Gaussian Wiretap Channel With an Average Power Constraint. IEEE Trans. Signal Process. 61(10): 2620-2631 (2013) - [c6]S. Ali A. Fakoorian, A. Lee Swindlehurst
On the optimality of polar codes for the deterministic wiretap channel. ACSSC 2013: 2089-2093 - [i5]S. Ali A. Fakoorian, A. Lee Swindlehurst:
On the Optimality of Linear Precoding for Secrecy in the MIMO Broadcast Channel. CoRR abs/1304.4627 (2013) - 2012
- [c5]S. Ali A. Fakoorian, Jing Huang, A. Lee Swindlehurst
Rank property of the MIMO Gaussian wiretap channel with an average power constraint. ACSCC 2012: 421-425 - [c4]S. Ali A. Fakoorian, A. Lee Swindlehurst
Optimal power allocation for GSVD-based beamforming in the MIMO Gaussian wiretap channel. ISIT 2012: 2321-2325 - [i4]S. Ali A. Fakoorian, A. Lee Swindlehurst:
Full Rank Solutions for the MIMO Gaussian Wiretap Channel with an Average Power Constraint. CoRR abs/1210.4795 (2012) - 2011
- [j2]S. Ali A. Fakoorian, A. Lee Swindlehurst
MIMO Interference Channel With Confidential Messages: Achievable Secrecy Rates and Precoder Design. IEEE Trans. Inf. Forensics Secur. 6(3-1): 640-649 (2011) - [j1]S. Ali A. Fakoorian, A. Lee Swindlehurst
Solutions for the MIMO Gaussian Wiretap Channel With a Cooperative Jammer. IEEE Trans. Signal Process. 59(10): 5013-5022 (2011) - [c3]S. Ali A. Fakoorian, Hamid Jafarkhani
Secure space-time block coding via artificial noise alignment. ACSCC 2011: 651-655 - [c2]S. Ali A. Fakoorian, A. Lee Swindlehurst
Dirty Paper Coding versus Linear GSVD-Based Precoding in MIMO Broadcast Channel with Confidential Messages. GLOBECOM 2011: 1-5 - [i3]S. Ali A. Fakoorian, A. Lee Swindlehurst:
Solutions for the MIMO Gaussian Wiretap Channel with a Cooperative Jammer. CoRR abs/1101.4435 (2011) - 2010
- [i2]S. Ali A. Fakoorian, A. Lee Swindlehurst:
Optimal Power Allocation for GSVD-Based Beamforming in the MIMO Wiretap Channel. CoRR abs/1006.1890 (2010) - [i1]Amitav Mukherjee, S. Ali A. Fakoorian, Jing Huang, A. Lee Swindlehurst:
Principles of Physical Layer Security in Multiuser Wireless Networks: A Survey. CoRR abs/1011.3754 (2010)
2000 – 2009
- 2008
- [c1]Navid MirMotahhary, S. Ali A. Fakoorian, Hamed Asadi, Reza Khaniki, Zahra Rahimkhani:
Joint Optimization of Node Cooperation and Energy Saving in Wireless Sensor Networks with Multiple Access Channel Setting. NTMS 2008: 1-5
Coauthor Index
manage site settings
To protect your privacy, all features that rely on external API calls from your browser are turned off by default. You need to opt-in for them to become active. All settings here will be stored as cookies with your web browser. For more information see our F.A.Q.
Unpaywalled article links
Add open access links from to the list of external document links (if available).
Privacy notice: By enabling the option above, your browser will contact the API of unpaywall.org to load hyperlinks to open access articles. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Unpaywall privacy policy.
Archived links via Wayback Machine
For web page which are no longer available, try to retrieve content from the of the Internet Archive (if available).
Privacy notice: By enabling the option above, your browser will contact the API of archive.org to check for archived content of web pages that are no longer available. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Internet Archive privacy policy.
Reference lists
Add a list of references from ,
, and
to record detail pages.
load references from crossref.org and opencitations.net
Privacy notice: By enabling the option above, your browser will contact the APIs of crossref.org, opencitations.net, and semanticscholar.org to load article reference information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Crossref privacy policy and the OpenCitations privacy policy, as well as the AI2 Privacy Policy covering Semantic Scholar.
Citation data
Add a list of citing articles from and
to record detail pages.
load citations from opencitations.net
Privacy notice: By enabling the option above, your browser will contact the API of opencitations.net and semanticscholar.org to load citation information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the OpenCitations privacy policy as well as the AI2 Privacy Policy covering Semantic Scholar.
OpenAlex data
Load additional information about publications from .
Privacy notice: By enabling the option above, your browser will contact the API of openalex.org to load additional information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the information given by OpenAlex.
last updated on 2024-04-25 05:37 CEST by the dblp team
all metadata released as open data under CC0 1.0 license
see also: Terms of Use | Privacy Policy | Imprint
dblp was originally created in 1993 at:
since 2018, dblp has been operated and maintained by:
the dblp computer science bibliography is funded and supported by: