default search action
Congzhe Cao
Person information
Refine list
refinements active!
zoomed in on ?? of ?? records
view refined list in
export refined list as
2020 – today
- 2022
- [j20]Huan Li
, Jing Guo
EXIT-Aided Scheduled Iterative MIMO Detection Under Non-Homogeneous Antenna Propagation Gain Scenarios. IEEE Trans. Veh. Technol. 71(10): 10600-10614 (2022) - 2021
- [j19]Congzhe Cao
Synchronization of Variable-Length Constrained Sequence Codes. IEEE Access 9: 45864-45878 (2021) - [j18]Jingxuan Huang
Reliable Broadcast Based on Online Fountain Codes. IEEE Commun. Lett. 25(2): 369-373 (2021) - [j17]Jingxuan Huang
Weighted Online Fountain Codes With Limited Buffer Size and Feedback Transmissions. IEEE Trans. Commun. 69(12): 7960-7973 (2021) - [c9]Hossein Khoshnevis
Novel Design of Irregular Polar Codes for Latency Reduction in Fast Polar Decoders. CCECE 2021: 1-5 - 2020
- [j16]Jingxuan Huang
Design and Analysis of Online Fountain Codes for Intermediate Performance. IEEE Trans. Commun. 68(9): 5313-5325 (2020) - [j15]Xinyi Wang
Nested Construction of Polar Codes for Blind Detection. IEEE Wirel. Commun. Lett. 9(5): 711-715 (2020) - [i5]Jingxuan Huang, Zesong Fei, Congzhe Cao, Ming Xiao:
Design and Analysis of Online Fountain Codes for Intermediate Performance. CoRR abs/2001.06452 (2020)
2010 – 2019
- 2019
- [j14]Ce Sun
Low Complexity Polar Decoder for 5G Embb Control Channel. IEEE Access 7: 50710-50717 (2019) - [j13]Congzhe Cao
Construction of Multi-State Capacity-Approaching Variable-Length Constrained Sequence Codes With State-Independent Decoding. IEEE Access 7: 54746-54759 (2019) - [j12]Xinyi Wang
Multiple-Block Combined Decoding for Cell Search With Polar Codes. IEEE Access 7: 71770-71779 (2019) - [j11]Hanxiao Yu, Zesong Fei, Congzhe Cao, Ming Xiao
Analysis of irregular repetition spatially-coupled slotted ALOHA. Sci. China Inf. Sci. 62(8): 80302:1-80302:13 (2019) - [j10]Congzhe Cao
Deep Learning-Based Decoding of Constrained Sequence Codes. IEEE J. Sel. Areas Commun. 37(11): 2532-2543 (2019) - [j9]Congzhe Cao
Minimal Sets for Capacity-Approaching Variable-Length Constrained Sequence Codes. IEEE Trans. Commun. 67(2): 890-902 (2019) - [i4]Congzhe Cao, Duanshun Li, Ivan J. Fair:
Deep Learning-Based Decoding of Constrained Sequence Codes. CoRR abs/1906.06172 (2019) - 2018
- [j8]Dai Jia, Zesong Fei, Ming Xiao
Enhanced frameless slotted ALOHA protocol with Markov chains analysis. Sci. China Inf. Sci. 61(10): 102304:1-102304:11 (2018) - [j7]Congzhe Cao
Capacity-Approaching Variable-Length Pearson Codes. IEEE Commun. Lett. 22(7): 1310-1313 (2018) - [j6]Jingxuan Huang
Performance Analysis and Improvement of Online Fountain Codes. IEEE Trans. Commun. 66(12): 5916-5926 (2018) - [c8]Congzhe Cao, Duanshun Li, Ivan J. Fair:
Deep Learning-Based Decoding for Constrained Sequence Codes. GLOBECOM Workshops 2018: 1-7 - [c7]Toshiaki Koike-Akino
Turbo Product Codes with Irregular Polar Coding for High-Throughput Parallel Decoding in Wireless OFDM Transmission. ICC 2018: 1-7 - [c6]Toshiaki Koike-Akino, Congzhe Cao, Ye Wang, Keisuke Kojima, David S. Millar, Kieran Parsons:
Irregular Polar Turbo Product Coding for High-Throughput Optical Interface. OFC 2018: 1-3 - [i3]Congzhe Cao, Duanshun Li, Ivan J. Fair:
Deep Learning-Based Decoding for Constrained Sequence Codes. CoRR abs/1809.01859 (2018) - 2017
- [j5]Jingxuan Huang, Zesong Fei
On-Line Fountain Codes With Unequal Error Protection. IEEE Commun. Lett. 21(6): 1225-1228 (2017) - [c5]Toshiaki Koike-Akino
Irregular Polar Coding for Multi-Level Modulation in Complexity-Constrained Lightwave Systems. ECOC 2017: 1-3 - [c4]Congzhe Cao, Toshiaki Koike-Akino
Irregular Polar Coding for Massive MIMO Channels. GLOBECOM 2017: 1-7 - 2016
- [j4]Zesong Fei, Congzhe Cao, Ming Xiao
Improved Luby transform codes in low overhead regions for binary erasure channels. Trans. Emerg. Telecommun. Technol. 27(1): 84-91 (2016) - [j3]Congzhe Cao
Mitigation of Inter-Cell Interference in Flash Memory With Capacity-Approaching Variable-Length Constrained Sequence Codes. IEEE J. Sel. Areas Commun. 34(9): 2366-2377 (2016) - [c3]Congzhe Cao, Ivan J. Fair:
Construction of minimal sets for capacity-approaching variable-length constrained sequence codes. ACSSC 2016: 255-259 - 2014
- [j2]Congzhe Cao, Zesong Fei, Jinhong Yuan
Low complexity list successive cancellation decoding of polar codes. IET Commun. 8(17): 3145-3149 (2014) - [c2]Dai Jia, Zesong Fei, Shangguan Chenglin, Congzhe Cao, Jingming Kuang:
LT Codes with Limited Feedback. CIT 2014: 669-673 - 2013
- [j1]Congzhe Cao, Zesong Fei, Ming Xiao, Gaishi Huang, Chengwen Xing, Jingming Kuang:
An extended packetization-aware mapping algorithm for scalable video coding in finite-length fountain codes. Sci. China Inf. Sci. 56(4): 1-10 (2013) - [i2]Congzhe Cao, Zesong Fei, Jinhong Yuan, Jingming Kuang:
Low Complexity List Successive Cancellation Decoding of Polar Codes. CoRR abs/1309.3173 (2013) - [i1]Zesong Fei, Congzhe Cao, Ming Xiao, Iqbal Hussain, Jingming Kuang:
Improved LT Codes in Low Overhead Regions for Binary Erasure Channels. CoRR abs/1309.3195 (2013) - 2012
- [c1]Gaishi Huang, Zesong Fei, Yuan Zhou, Dai Jia, Congzhe Cao:
Retransmission scheme for multicast transmission based on Network Coding and link adaptation. CHINACOM 2012: 508-513
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-07-05 21:01 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: