default search action
Google
Google Scholar
Semantic Scholar
Internet Archive Scholar
CiteSeerX
ORCIDQiuju Diao
Person information
Refine list
refinements active!
zoomed in on ?? of ?? records
view refined list in
export refined list as
Journal Articles
- 2016
[j4]Qiuju Diao, Juane Li, Shu Lin
, Ian F. Blake:
New Classes of Partial Geometries and Their Associated LDPC Codes. IEEE Trans. Inf. Theory 62(6): 2947-2965 (2016)- 2013
- [j3]Qiuju Diao, Ying Yu Tai, Shu Lin, Khaled A. S. Abdel-Ghaffar:
LDPC Codes on Partial Geometries: Construction, Trapping Set Structure, and Puncturing. IEEE Trans. Inf. Theory 59(12): 7898-7914 (2013) - 2012
- [j2]Qin Huang, Qiuju Diao, Shu Lin, Khaled A. S. Abdel-Ghaffar:
Cyclic and Quasi-Cyclic LDPC Codes on Constrained Parity-Check Matrices and Their Trapping Sets. IEEE Trans. Inf. Theory 58(5): 2648-2671 (2012) - [j1]Qiuju Diao, Qin Huang, Shu Lin, Khaled A. S. Abdel-Ghaffar:
A Matrix-Theoretic Approach for Analyzing Quasi-Cyclic Low-Density Parity-Check Codes. IEEE Trans. Inf. Theory 58(6): 4030-4048 (2012)
Conference and Workshop Papers
- 2014
- [c11]Shu Lin, Qiuju Diao, Ian F. Blake:
Error floors and finite geometries. ISTC 2014: 42-46 - 2013
- [c10]Qiuju Diao, Ying Yu Tai, Shu Lin, Khaled A. S. Abdel-Ghaffar:
Correcting combinations of errors and erasures with Euclidean geometry LDPC codes. ISIT 2013: 1685-1689 - [c9]Qiuju Diao, Ying Yu Tai, Shu Lin, Khaled A. S. Abdel-Ghaffar:
Trapping set structure of LDPC codes on finite geometries. ITA 2013: 1-8 - [c8]Qiuju Diao, Ying Yu Tai, Shu Lin, Khaled A. S. Abdel-Ghaffar:
Trapping set structure of LDPC codes on finite geometries. ITA 2013: 1-8 - 2012
- [c7]Qiuju Diao, Ying Yu Tai, Shu Lin, Khaled A. S. Abdel-Ghaffar:
Trapping set structure of finite geometry LDPC codes. ISIT 2012: 3088-3092 - [c6]Qiuju Diao, Wei Zhou, Shu Lin, Khaled A. S. Abdel-Ghaffar:
A transform approach for constructing quasi-cyclic Euclidean geometry LDPC codes. ITA 2012: 204-211 - 2011
- [c5]Qiuju Diao, Qin Huang, Shu Lin, Khaled A. S. Abdel-Ghaffar:
A transform approach for computing the ranks of parity-check matrices of quasi-cyclic LDPC codes. ISIT 2011: 366-370 - [c4]Qin Huang, Qiuju Diao, Shu Lin, Khaled A. S. Abdel-Ghaffar:
Trapping sets of structured LDPC codes. ISIT 2011: 1086-1090 - [c3]Qiuju Diao, Qin Huang, Shu Lin, Khaled A. S. Abdel-Ghaffar:
A transform approach for analyzing and constructing quasi-cyclic low-density parity-check codes. ITA 2011: 15-22 - [c2]Qin Huang, Qiuju Diao, Shu Lin, Khaled A. S. Abdel-Ghaffar:
Cyclic and quasi-cyclic LDPC codes: New developments. ITA 2011: 186-195 - 2010
- [c1]Qin Huang, Qiuju Diao, Shu Lin:
Circulant decomposition: Cyclic, quasi-cyclic and LDPC codes. ISITA 2010: 383-388
Informal and Other Publications
- 2015
- [i2]Qiuju Diao, Juane Li, Shu Lin, Ian F. Blake:
New Classes of Partial Geometries and Their Associated LDPC Codes. CoRR abs/1503.06900 (2015) - 2010
- [i1]Qin Huang, Qiuju Diao, Shu Lin, Khaled A. S. Abdel-Ghaffar:
Cyclic and Quasi-Cyclic LDPC Codes on Row and Column Constrained Parity-Check Matrices and Their Trapping Sets. CoRR abs/1012.3201 (2010)
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:43 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:
