default search action
Hua Xiao 0003
Person information
- affiliation: Carleton University, Department of Systems and Computer Engineering, Ottawa, Canada
Other persons with the same name
- Hua Xiao — disambiguation page
- Hua Xiao 0001 — IBM Canada Laboratory, Markham, Canada (and 1 more)
- Hua Xiao 0002
— Shandong University, School of Mathematics and Statistics, Weihai, China
Refine list
refinements active!
zoomed in on ?? of ?? records
view refined list in
export refined list as
2010 – 2019
- 2013
- [j7]Hua Xiao, Amir H. Banihashemi, Mehdi Karimi:
Error Rate Estimation of Low-Density Parity-Check Codes Decoded by Quantized Soft-Decision Iterative Algorithms. IEEE Trans. Commun. 61(2): 474-484 (2013)
2000 – 2009
- 2009
- [j6]Hua Xiao, Amir H. Banihashemi:
Error rate estimation of low-density parity-check codes on binary symmetric channels using cycle enumeration. IEEE Trans. Commun. 57(6): 1550-1555 (2009) - [j5]Hua Xiao, Amir H. Banihashemi:
Comments on successive relaxation for decoding of LDPC codes. IEEE Trans. Commun. 57(10): 2846-2848 (2009) - 2008
- [c3]Hua Xiao, Amir H. Banihashemi:
Error rate estimation of finite-length low-density parity-check codes decoded by soft-decision iterative algorithms. ISIT 2008: 439-443 - 2007
- [j4]Hua Xiao, Amir H. Banihashemi:
Estimation of Bit and Frame Error Rates of Finite-Length Low-Density Parity-Check Codes on Binary Symmetric Channels. IEEE Trans. Commun. 55(12): 2234-2239 (2007) - [c2]Hua Xiao, Amir H. Banihashemi:
Error Rate Estimation of Finite-Length Low-Density Parity-Check Codes on Binary Symmetric Channels Using Cycle Enumeration. ISIT 2007: 1551-1555 - 2006
- [i1]Hua Xiao, Amir H. Banihashemi:
Estimation of Bit and Frame Error Rates of Low-Density Parity-Check Codes on Binary Symmetric Channels. CoRR abs/cs/0612011 (2006) - 2005
- [j3]Pirouz Zarrinkhat, Amir H. Banihashemi, Hua Xiao:
Time-invariant and switch-type hybrid iterative decoding of low-density parity-check codes. Ann. des Télécommunications 60(1-2): 103-131 (2005) - 2004
- [j2]Hua Xiao, Amir H. Banihashemi:
Improved progressive-edge-growth (PEG) construction of irregular LDPC codes. IEEE Commun. Lett. 8(12): 715-717 (2004) - [j1]Hua Xiao, Amir H. Banihashemi:
Graph-based message-passing schedules for decoding LDPC codes. IEEE Trans. Commun. 52(12): 2098-2105 (2004) - [c1]Hua Xiao, Amir H. Banihashemi:
Improved progressive-edge-growth (PEG) construction of irregular LDPC codes. GLOBECOM 2004: 489-492
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-02-28 22:07 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: