default search action
Google
Google Scholar
Semantic Scholar
Internet Archive Scholar
CiteSeerX
ORCIDZhen-Ming Huang
Person information
Refine list
refinements active!
zoomed in on ?? of ?? records
view refined list in
export refined list as
2020 – today
- 2025
[j8]Zhen-Ming Huang, Chen Hu, Zi Long Liu, Chao-Yu Chen:
Cross Z-Complementary Sets With Flexible Lengths for Optimal Training Design in Spatial Modulation. IEEE Trans. Commun. 73(1): 132-144 (2025)- 2024
- [j7]Zhen-Ming Huang
, Cheng-Yu Pai, Zi Long Liu, Chao-Yu Chen:
Enhanced Cross Z-Complementary Set and Its Application in Generalized Spatial Modulation. IEEE Open J. Commun. Soc. 5: 4674-4690 (2024) - [j6]You-Qi Zhao, Cheng-Yu Pai, Zhen-Ming Huang, Zilong Liu, Chao-Yu Chen:
Two-Dimensional Golay Complementary Array Sets With Arbitrary Lengths for Omnidirectional MIMO Transmission. IEEE Trans. Commun. 72(2): 1135-1145 (2024) - [c4]Zhen-Ming Huang, Cheng-Yu Pai, Zilong Liu, Chao-Yu Chen:
A New Construction of Enhanced Cross Z-Complementary Sets with Maximum Zero Correlation Zone. ISIT 2024: 1137-1142 - [i3]Cheng-Yu Pai, Yu-Che Tung, Zhen-Ming Huang, Chao-Yu Chen:
Set Size Bound for Aperiodic Z-Complementary Sets. CoRR abs/2412.01438 (2024) - 2023
- [j5]Zhen-Ming Huang, Chen Hu, Zilong Liu, Chao-Yu Chen:
On the Mates of Cross Z-Complementary Pairs for Training Sequence Design in Generalized Spatial Modulation. IEEE Access 11: 145231-145237 (2023) - [i2]You-Qi Zhao, Cheng-Yu Pai, Zhen-Ming Huang, Zilong Liu, Chao-Yu Chen:
Two-Dimensional Golay Complementary Array Sets With Arbitrary Lengths for Omnidirectional MIMO Transmission. CoRR abs/2301.01225 (2023) - [i1]Zhen-Ming Huang, Cheng-Yu Pai, Zilong Liu, Chao-Yu Chen:
Enhanced Cross Z-Complementary Set and Its Application in Generalized Spatial Modulation. CoRR abs/2311.18390 (2023) - 2022
- [j4]Zhen-Ming Huang, Cheng-Yu Pai, Chao-Yu Chen:
Cross Z-Complementary Sets for Training Design in Spatial Modulation. IEEE Trans. Commun. 70(8): 5030-5045 (2022) - [c3]Zhen-Ming Huang, Cheng-Yu Pai, Chao-Yu Chen:
A Novel Construction of Optimal Cross Z-Complementary Sets Based on Generalized Boolean Functions. ISIT 2022: 1725-1730 - [c2]Cheng-Yu Pai, Zi Long Liu, You-Qi Zhao, Zhen-Ming Huang, Chao-Yu Chen:
Designing Two-Dimensional Complete Complementary Codes for Omnidirectional Transmission in Massive MIMO Systems. ISIT 2022: 2285-2290 - [c1]Yu Lee, Tzu-Chieh Kao, Zhen-Ming Huang, Hsuan-Po Lin, Chun-Ta Wu, Chao-Yu Chen:
Robust Timing Synchronization Algorithm for 5G New Radio. WF-IoT 2022: 1-5 - 2021
- [j3]Shing-Wei Wu, Alphan Sahin, Zhen-Ming Huang, Chao-Yu Chen:
Z-Complementary Code Sets With Flexible Lengths From Generalized Boolean Functions. IEEE Access 9: 4642-4652 (2021) - [j2]Zhen-Ming Huang, Cheng-Yu Pai, Chao-Yu Chen:
Binary Cross Z-Complementary Pairs With Flexible Lengths From Boolean Functions. IEEE Commun. Lett. 25(4): 1057-1061 (2021) - [j1]Yu-Jen Lin, Zhen-Ming Huang, Chao-Yu Chen:
Golay Complementary Sets and Multiple-Shift Complementary Sets With Non-Power-of-Two Length and Bounded PAPRs. IEEE Commun. Lett. 25(9): 2805-2809 (2021)
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 2025-01-28 23:36 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:
