default search action
Chao Chen 0013
Person information
- affiliation: Xidian University, Xi'an, China
Other persons with the same name
- Chao Chen — disambiguation page
- Chao Chen 0001
— Indiana University - Purdue University Fort Wayne, Department of Engineering, IN, USA
- Chao Chen 0002
- Chao Chen 0003
- Chao Chen 0004
- Chao Chen 0005
- Chao Chen 0006 — Qualcomm Incorporated, San Diego, CA, USA (and 1 more)
- Chao Chen 0007
- Chao Chen 0008
- Chao Chen 0009
- Chao Chen 0010 — Shandong Normal University, School of Management Science and Engineering, China
- Chao Chen 0011 — University of Warwick, Coventry, UK
- Chao Chen 0012
- Chao Chen 0014 — University of Miami, Coral Gables, FL, USA
- Chao Chen 0015
- Chao Chen 0016
- Chao Chen 0017
- Chao Chen 0018 — Southeast University, National ASIC Research Center, Nanjing, China
- Chao Chen 0019
- Chao Chen 0020 — University of Florida, Department of Computer and Information Sciences and Engineering, Gainesville, FL, USA
- Chao Chen 0021 — Fortiss GmbH, affiliated institute of Technische Universität München, Munich, Germany
- Chao Chen 0022
- Chao Chen 0023
- Chao Chen 0024
- Chao Chen 0025 — Beihang University, Beijing, China
- Chao Chen 0026
- Chao Chen 0027
Refine list
refinements active!
zoomed in on ?? of ?? records
view refined list in
export refined list as
2020 – today
- 2024
- [j18]Huaan Li
Efficient Construction of Quasi-Cyclic LDPC Codes With Multiple Lifting Sizes. IEEE Commun. Lett. 28(4): 754-758 (2024) - [j17]Nianqi Tang
Fast Error and Erasure Decoding Algorithm for Reed-Solomon Codes. IEEE Commun. Lett. 28(4): 759-762 (2024) - [c16]Chao Chen, Baoming Bai, Xiao Ma, Yunghsiang S. Han, Nianqi Tang, Xiaotian Wang:
Efficient Decoding of a Class of Reed-Solomon Codes Over Fermat Fields. ISIT 2024: 476-481 - 2023
- [j16]Tongzhou Yu, Baoming Bai, Ruimin Yuan, Chao Chen:
A Model-Driven Approach to Enhance Faster-than-Nyquist Signaling over Nonlinear Channels. J. Commun. Inf. Networks 8(4): 341-348 (2023) - [c15]Chao Chen, Nianqi Tang, Yunghsiang S. Han, Baoming Bai:
On the Equivalence between the Welch-Berlekamp Algorithm and the Modular Approach Algorithm. ICCC Workshops 2023: 1-5 - [c14]Jin Luo, Yang Bai, Baoming Bai, Chao Chen, Wenkun Wen:
A Multi-layer Superposition Modulation Scheme to Improve the Data Rate for IoT Communications. ICCC Workshops 2023: 1-6 - [c13]Chao Chen, Yunghsiang S. Han, Nianqi Tang, Sian-Jheng Lin, Baoming Bai, Xiao Ma:
An Early-Termination Method for the Welch-Berlekamp Algorithm. ISIT 2023: 815-819 - [c12]Zhongwei Li, Yunghsiang Sam Han, Sian-Jheng Lin, Chao Chen:
An Efficient Reed-Solomon Erasure Code over Cantor-constructed Binary Extension Finite Fields. ISIT 2023: 826-831 - [c11]Chao Chen, Sian-Jheng Lin, Zhongwei Li, Suihua Cai, Yunghsiang S. Han, Bo Bai:
Reduced-Complexity Erasure Decoding of Low-Rate Reed-Solomon Codes Based on LCH-FFT. ISIT 2023: 1015-1019 - [c10]Suihua Cai, Chao Chen, Yunqi Wan, Xiao Ma:
Fast Encoding of Hermitian Codes Based on Lin-Chung-Han Fast Fourier Transform. ISIT 2023: 2069-2074 - [c9]Chao Chen, Suihua Cai, Yunghsiang S. Han, Nianqi Tang, Baoming Bai:
Fast Encoding of Extended Integrated Interleaved Codes Based on Two-Dimensional LCH-FFT. ISTC 2023: 1-5 - 2022
- [c8]Juewei Wang, Chao Chen, Xiao Ma:
Block Markov Superposition Transmission of Algebraic QC-LDPC Codes for Optical Fiber Communications. WOCC 2022: 74-79 - 2021
- [j15]Yunghsiang S. Han, Chao Chen, Sian-Jheng Lin, Baoming Bai:
On fast Fourier transform-based decoding of Reed-Solomon codes. Int. J. Ad Hoc Ubiquitous Comput. 36(3): 180-187 (2021) - [c7]Huaan Li, Baoming Bai, Hengzhou Xu, Chao Chen:
Construction of Algebraic-Based Variable-Rate QC-LDPC Codes. ISIT 2021: 374-379
2010 – 2019
- 2019
- [j14]Raymond W. Yeung
On Information-Theoretic Characterizations of Markov Random Fields and Subfields. IEEE Trans. Inf. Theory 65(3): 1493-1511 (2019) - [c6]Jipeng Zhang, Zhongyang Yu, Ji Zhang, Baoming Bai, Chao Chen, Fuwei Huang:
Speeding up LDPC Decoder by Inter-Frame Pipeline for Wireless Laser Communications. ICCC 2019: 556-560 - [c5]Chao Chen, Yunghsiang S. Han, Zhongfeng Wang, Baoming Bai:
A New Inversionless Berlekamp-Massey Algorithm with Efficient Architecture. SiPS 2019: 48-53 - 2018
- [j13]Hengzhou Xu, Chao Chen, Min Zhu, Baoming Bai, Bo Zhang:
Nonbinary LDPC cycle codes: efficient search, design, and code optimization. Sci. China Inf. Sci. 61(8): 089303:1-089303:3 (2018) - [c4]Chao Chen, Haiyang Liu, Baoming Bai:
Finite Hyperplane Codes: Minimum Distance and Majority-Logic Decoding. ISIT 2018: 2500-2504 - [c3]Xijin Mu, Huaan Li, Chao Chen, Jinhong Yuan, Baoming Bai:
A New Algebraic-Based Method for Constructing Protograph LDPC Codes. ISTC 2018: 1-5 - 2017
- [j12]Xiaopeng Jiao
Efficient ADMM Decoding of LDPC Codes Using Lookup Tables. IEEE Trans. Commun. 65(4): 1425-1437 (2017) - [c2]Raymond W. Yeung, Ali Al-Bashabsheh, Chao Chen, Qi Chen, Pierre Moulin:
Information-theoretic characterizations of Markov random fields and subfields. ISIT 2017: 3040-3044 - 2016
- [i2]Raymond W. Yeung, Ali Al-Bashabsheh, Chao Chen, Qi Chen, Pierre Moulin:
On Characterizations of Markov Random Fields and Subfields. CoRR abs/1608.03697 (2016) - 2015
- [j11]Chao Chen, Hongmei Xie, Baoming Bai:
Layered subspace codes for random network coding. Trans. Emerg. Telecommun. Technol. 26(3): 461-468 (2015) - [j10]Chao Chen, Xiaotian Wang, Baoming Bai, Guangming Shi:
Constant Weight Codes From Constant Dimension Codes and Their Applications. IEEE Commun. Lett. 19(3): 311-314 (2015) - [j9]Xiaopeng Jiao, Haoyuan Wei
Improved ADMM Penalized Decoder for Irregular Low-Density Parity-Check Codes. IEEE Commun. Lett. 19(6): 913-916 (2015) - [j8]Chao Chen, Baoming Bai, Guangming Shi, Xiaotian Wang, Xiaopeng Jiao:
Nonbinary LDPC Codes on Cages: Structural Property and Code Optimization. IEEE Trans. Commun. 63(2): 364-375 (2015) - 2013
- [j7]Chao Chen, Baoming Bai, Xinquan Yang, Li Li, Yang Yang:
Enhancing Iterative Decoding of Cyclic LDPC Codes Using Their Automorphism Groups. IEEE Trans. Commun. 61(6): 2128-2137 (2013) - 2012
- [j6]Chao Chen, Baoming Bai, Zhuo Li, Xinquan Yang, Li Li:
Nonbinary Cyclic LDPC Codes Derived from Idempotents and Modular Golomb Rulers. IEEE Trans. Commun. 60(3): 661-668 (2012) - [i1]Chao Chen, Hongmei Xie, Baoming Bai:
Layered Subspace Codes for Network Coding. CoRR abs/1209.2894 (2012) - 2011
- [j5]Yang Yang, Chao Chen, Jianjun Mu, Jing Wang, Rong Sun, Xinmei Wang:
Nonbinary Quasi-Cyclic LDPC Cycle Codes with Low-Density Systematic Quasi-Cyclic Generator Matrices. IEICE Trans. Commun. 94-B(9): 2620-2623 (2011) - 2010
- [j4]Chao Chen, Baoming Bai, Xinmei Wang:
Construction of nonbinary quasi-cyclic LDPC cycle codes based on singer perfect difference set. IEEE Commun. Lett. 14(2): 181-183 (2010) - [j3]Chao Chen, Baoming Bai, Xinmei Wang, Ming Xu:
Nonbinary LDPC codes constructed based on a cyclic MDS code and a low-complexity nonbinary message-passing decoding algorithm. IEEE Commun. Lett. 14(3): 239-241 (2010) - [j2]Chao Chen, Baoming Bai, Xinmei Wang:
Construction of quasi-cyclic LDPC codes based on a two-dimensional MDS code. IEEE Commun. Lett. 14(5): 447-449 (2010) - [j1]Dayuan Zhao, Xiao Ma, Chao Chen, Baoming Bai:
A Low Complexity Decoding Algorithm for Majority-Logic Decodable Nonbinary LDPC Codes. IEEE Commun. Lett. 14(11): 1062-1064 (2010) - [c1]Chao Chen, Baoming Bai, Xinmei Wang:
Two-dimensional generalized Reed-Solomon codes: A unified framework for quasi-cyclic LDPC codes constructed based on finite fields. ISIT 2010: 839-843
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-12-13 19:11 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: