default search action
Xianbin Wang 0002
Person information
- affiliation: Zhejiang University, College of Information Science and Electronic Engineering, Hangzhou, China
Other persons with the same name
- Xianbin Wang — disambiguation page
- Xianbin Wang 0001 — University of Western Ontario, Department of Electrical and Computer Engineering, London, ON, Canada (and 1 more)
- Xianbin Wang 0003 — Huawei Technologies Co, Huawei Hangzhou Research Center, Hangzhou 310052, China
Refine list
refinements active!
zoomed in on ?? of ?? records
view refined list in
export refined list as
2010 – 2019
- 2018
- [j5]Zhaoyang Zhang, Xianbin Wang, Yu Zhang, Yan Chen:
Rateless Multiple Access: Asymptotic Throughput Analysis and Improvement With Spatial Coupling. IEEE Access 6: 63200-63213 (2018) - [c9]Jue Wang, Zhaoyang Zhang, Xianbin Wang, Hong Wang, Chunxu Jiao:
A Low-Complexity Reconstruction Algorithm for Compressed Sensing Using Reed-Muller Sequences. ICC 2018: 1-6 - 2017
- [j4]Zhaoyang Zhang, Hong Wang, Guanding Yu, Yu Zhang, Xianbin Wang:
Universal Filtered Multi-Carrier Transmission With Adaptive Active Interference Cancellation. IEEE Trans. Commun. 65(6): 2554-2567 (2017) - [c8]Ye Zhu, Xianbin Wang, Zhaoyang Zhang, Xiaoming Chen, Yan Chen:
A rate-splitting non-orthogonal multiple access scheme for uplink transmission. WCSP 2017: 1-6 - [c7]Ye Zhu, Zhaoyang Zhang, Xianbin Wang, Xuesong Liang:
A low-complexity non-orthogonal multiple access system based on rate splitting. WCSP 2017: 1-6 - 2016
- [j3]Zhaoyang Zhang, Xianbin Wang, Yu Zhang, Yan Chen:
Grant-Free Rateless Multiple Access: A Novel Massive Access Scheme for Internet of Things. IEEE Commun. Lett. 20(10): 2019-2022 (2016) - [j2]Zhaoyang Zhang, Liang Zhang, Xianbin Wang, Caijun Zhong, H. Vincent Poor:
A Split-Reduced Successive Cancellation List Decoder for Polar Codes. IEEE J. Sel. Areas Commun. 34(2): 292-302 (2016) - [i2]Zhaoyang Zhang, Xianbin Wang, Yu Zhang, Yan Chen:
Grant-free Rateless Multiple Access: A Novel Massive Access Scheme for Internet of Things. CoRR abs/1607.05017 (2016) - 2015
- [j1]Liang Zhang, Zhaoyang Zhang, Xianbin Wang, Caijun Zhong, Li Ping:
Simplified successive-cancellation decoding using information set reselection for polar codes with arbitrary blocklength. IET Commun. 9(11): 1380-1387 (2015) - [c6]Xianbin Wang, Zhaoyang Zhang, Yu Zhang, Liang Zhang, Yan Chen:
Multi-Carrier Rateless Multiple Access: A Novel Protocol for Dynamic Massive Access. GLOBECOM 2015: 1-6 - [i1]Zhaoyang Zhang, Liang Zhang, Xianbin Wang, Caijun Zhong, H. Vincent Poor:
A Split-Reduced Successive Cancellation List Decoder for Polar Codes. CoRR abs/1511.02150 (2015) - 2014
- [c5]Liang Zhang, Zhaoyang Zhang, Xianbin Wang:
Iterative multistage decoding of polar code based multilevel codes. ICC 2014: 2021-2026 - [c4]Liang Zhang, Zhaoyang Zhang, Xianbin Wang, Qilian Yu, Yan Chen:
On the puncturing patterns for punctured polar codes. ISIT 2014: 121-125 - [c3]Xianbin Wang, Zhaoyang Zhang, Liang Zhang:
On the SC decoder for any polar code of length N =ln. WCNC 2014: 485-489 - 2013
- [c2]Xianbin Wang, Zhaoyang Zhang, Liang Zhang:
On the polar codes for MIMO. WCSP 2013: 1-5 - 2012
- [c1]Liang Zhang, Zhaoyang Zhang, Xianbin Wang:
Polar code with block-length N = 3n. WCSP 2012: 1-6
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-11-14 21:01 CET by the dblp team
all metadata released as open data under CC0 1.0 license
see also: Terms of Use | Privacy Policy | Imprint