default search action
Google
Google Scholar
Semantic Scholar
Internet Archive Scholar
CiteSeerX
ORCIDLiangzhong Ruan
- > Home > Persons > Liangzhong Ruan
Publications
- 2018
[j13]Liangzhong Ruan
, Andrea Conti, Moe Z. Win:
Unified Interference Engineering for Wireless Information Secrecy. IEEE J. Sel. Areas Commun. 36(7): 1579-1592 (2018)- [j12]Fanggang Wang, Liangzhong Ruan, Moe Z. Win:
Cooperative Network Operation Design for Mobility-Aware Cloud Radio Access Network. IEEE Trans. Wirel. Commun. 17(12): 7819-7833 (2018) - 2017
- [c11]Fanggang Wang, Liangzhong Ruan, Moe Z. Win:
Location-aware network operation for cloud radio access network. ICASSP 2017: 3714-3718 - 2016
- [j11]Liangzhong Ruan, Vincent K. N. Lau, Moe Z. Win:
Generalized Interference Alignment - Part I: Theoretical Framework. IEEE Trans. Signal Process. 64(10): 2675-2687 (2016) - [j10]Liangzhong Ruan, Vincent K. N. Lau, Moe Z. Win:
Generalized Interference Alignment - Part II: Application to Wireless Secrecy. IEEE Trans. Signal Process. 64(10): 2688-2701 (2016) - [c10]Liangzhong Ruan, Wenhan Dai, Moe Z. Win:
Analysis of Efficient Recurrence Quantum Entanglement Distillation. GLOBECOM Workshops 2016: 1-6 - 2015
- [j9]Moe Z. Win, Liangzhong Ruan, Alberto Rabbachin, Yuan Shen, Andrea Conti:
Multi-tier network secrecy in the ether. IEEE Commun. Mag. 53(6): 28-32 (2015) - [c9]Liangzhong Ruan, Wenhan Dai, Moe Z. Win:
Efficient Recurrence Quantum Distillation Algorithm for Phase-Damping Channel. GLOBECOM Workshops 2015: 1-6 - [i9]Liangzhong Ruan, Vincent K. N. Lau, Moe Z. Win:
Generalized Interference Alignment - Part I: Theoretical Framework. CoRR abs/1503.06358 (2015) - [i8]Liangzhong Ruan, Vincent K. N. Lau, Moe Z. Win:
Generalized Interference Alignment - Part II: Application to Wireless Secrecy. CoRR abs/1503.06361 (2015) - 2013
- [j7]Liangzhong Ruan, Vincent K. N. Lau, Moe Z. Win:
The Feasibility Conditions for Interference Alignment in MIMO Networks. IEEE Trans. Signal Process. 61(8): 2066-2077 (2013) - [c8]Liangzhong Ruan, Moe Z. Win, Vincent K. N. Lau:
Designing interference alignment algorithms by algebraic geometry analysis. GLOBECOM 2013: 1796-1801 - 2012
- [c6]Liangzhong Ruan, Vincent K. N. Lau, Moe Z. Win:
Feasibility conditions of interference alignment with general alignment set. ACSCC 2012: 564-568 - [c4]Liangzhong Ruan, Vincent K. N. Lau, Moe Z. Win:
The feasibility conditions of interference alignment for MIMO interference networks. ISIT 2012: 2486-2490 - [i3]Liangzhong Ruan, Vincent K. N. Lau, Moe Z. Win:
The Feasibility Conditions for Interference Alignment in MIMO Networks. CoRR abs/1211.3484 (2012)
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 2025-01-20 22:55 CET 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:
