default search action
Erbao Li
Person information
Refine list
refinements active!
zoomed in on ?? of ?? records
view refined list in
export refined list as
2010 – 2019
- 2019
- [c9]Jianbin Zou, Kai Gao, Erbao Li:
10Gbps Real-time OFDM Wireless Communication System. ISCSIC 2019: 54:1-54:5 - 2018
- [j8]Zhipeng Pan
, Erbao Li, Lei Zhang
Design and Optimization of Joint Iterative Detection and Decoding Receiver for Uplink Polar Coded SCMA System. IEEE Access 6: 52014-52026 (2018) - [j7]Erbao Li, Le Dong, Jing Lei:
High Rate APPS and Bi-APPS LDPC Codes Design with Low Error Floor and Large Girth. Wirel. Pers. Commun. 100(3): 709-720 (2018) - [c8]Zhipeng Pan, Erbao Li, Lei Wen, Jing Lei, Chaojing Tang:
Joint Iterative Detection and Decoding Receiver for Polar Coded SCMA System. ICC Workshops 2018: 1-6 - 2017
- [j6]Hua Zhou, Erbao Li, Jing Lei:
Serially concatenated belief propagation decoder for low-density parity-check codes. IET Commun. 11(14): 2133-2140 (2017) - [j5]Jing Lei, Erbao Li, Wenwen Li:
Design of Rate-Compatible QC-IRA-d Codes Based on Gaussian Approximation Analysis and Graph Extension. Wirel. Pers. Commun. 97(2): 2269-2282 (2017) - 2016
- [c7]Ke Lai, Erbao Li, Jing Lei:
Threshold-based extended minimum-sum algorithm for non-binary LDPC codes. WCSP 2016: 1-5 - 2015
- [c6]Wenwen Li, Jing Lei, Erbao Li, Baoguo Li:
Novel Extending Scheme for the Construction of Rate-Compatible IRA-Like Codes. VTC Spring 2015: 1-5 - 2014
- [j4]Xiaotian Li, Jing Lei, Wei Liu, Erbao Li, Yanbin Li:
Blind Channel Estimation Based on Multilevel Lloyd-Max Iteration for Nonconstant Modulus Constellations. J. Appl. Math. 2014: 146207:1-146207:7 (2014) - [j3]Francisco Garcia-Herrero, Erbao Li, David Declercq, Javier Valls
Multiple-Vote Symbol-Flipping Decoder for Nonbinary LDPC Codes. IEEE Trans. Very Large Scale Integr. Syst. 22(11): 2256-2267 (2014) - [c5]Le Dong, Ziyu Zhao, Jing Lei, Erbao Li:
Lower error floor of LDPC codes based on trapping sets elimination. WCSP 2014: 1-5 - 2013
- [j2]Erbao Li, David Declercq, Kiran K. Gunnam
Trellis-Based Extended Min-Sum Algorithm for Non-Binary LDPC Codes and its Hardware Structure. IEEE Trans. Commun. 61(7): 2600-2611 (2013) - [j1]David Declercq, Bane Vasic, Shiva Kumar Planjery, Erbao Li:
Finite Alphabet Iterative Decoders - Part II: Towards Guaranteed Error Correction of LDPC Codes via Iterative Decoder Diversity. IEEE Trans. Commun. 61(10): 4046-4057 (2013) - [c4]Erbao Li, Francisco Garcia-Herrero, David Declercq, Kiran K. Gunnam
Low latency T-EMS decoder for non-binary LDPC codes. ACSSC 2013: 831-835 - 2012
- [c3]David Declercq, Bane Vasic, Shiva Kumar Planjery, Erbao Li:
Finite alphabet iterative decoders approaching maximum likelihood performance on the Binary Symmetric Channel. ITA 2012: 23-32 - [c2]David Declercq, Erbao Li, Bane Vasic, Shiva Kumar Planjery:
Approaching maximum likelihood decoding of finite length LDPC codes via FAID diversity. ITW 2012: 487-491 - [i1]David Declercq, Bane Vasic, Shiva Kumar Planjery, Erbao Li:
Finite Alphabet Iterative Decoders, Part II: Improved Guaranteed Error Correction of LDPC Codes via Iterative Decoder Diversity. CoRR abs/1207.4807 (2012) - 2011
- [c1]Erbao Li, Kiran K. Gunnam
Trellis based Extended Min-Sum for decoding nonbinary LDPC codes. ISWCS 2011: 46-50
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:59 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: