The DOI matches its Crossref record; 21 of the 21 references it cites were found in a registry or an index.
On Construction of Low-Density Parity-Check Codes for Ultra-Reliable and Low Latency Communications
Abstract
Low-density parity-check (LDPC) codes with protograph-based raptor-like (PBRL) structure have been chosen as the data channel coding scheme for the fifth-generation (5G) enhanced mobile broad band (eMBB) services. However, these 5G LDPC codes are not optimized for the scenarios of Ultra Reliable and Low Latency Communications (URLLC) and massive Machine Type Communications (mMTC) in which small transport block sizes are usually used. In this paper, a new method is proposed to construct PBRL LDPC codes for URLLC and mMTC. This method incorporates degree-distribution optimization, base matrix derived from parity-check matrix of quadratic residue codes, masking technique and modified progressive-edge-growth (PEG) algorithm. Simulation results show that the proposed PBRL LDPC codes outperform 5G LDPC short codes in terms of error-correcting performance.
Overview
Integrity signals
Registry
Cites
Statistics
Verification
Claims the paper makes
Claims other papers make about this one
Each is checked against this paper’s own text: does it say what the citing paper says it does?
In the citing paper
“The use of advanced modulation and coding schemes (i.e., LDPC), along with strategically implemented network protocols (i.e., DARAS, DATPCP, and DPA-VN), significantly mitigated these effects.”
From Enhancing Intelligent Transport Systems Through Decentralized Security Frameworks in Vehicle-to-Everything Networks (2025) · cites this paper as [35]
In the citing paper
“LDPC utilized a sparse parity-check matrix to decode received messages effectively which significantly reduced the error rate.”
From Enhancing Intelligent Transport Systems Through Decentralized Security Frameworks in Vehicle-to-Everything Networks (2025) · cites this paper as [35]
Citations
Cites
Low-density parity-check codes
Gallager, R. G. (1962) · IEEE Transactions on Information Theory · doi:10.1109/tit.1962.1057683 · Cited by 10,727
Arıkan, E. (2009) · IEEE Transactions on Information Theory · doi:10.1109/tit.2009.2021379 · Cited by 4,470
Quasi-Cyclic Low-Density Parity-Check Codes From Circulant Permutation Matrices
Fossorier, M. P. C. (2004) · IEEE Transactions on Information Theory · doi:10.1109/tit.2004.831841 · Cited by 1,218
Design of Low-Density Parity Check Codes for 5G New Radio
Richardson, T., & Kudekar, S. (2018) · IEEE Communications Magazine · doi:10.1109/mcom.2018.1700839 · Cited by 437
Short Block-Length Codes for Ultra-Reliable Low Latency Communications
Shirvanimoghaddam, M., Mohammadi, M. S., Abbas, R., Minja, A., Yue, C., Matuz, B., Han, G., Lin, Z., Liu, W., Li, Y., et al. (2018) · IEEE Communications Magazine · doi:10.1109/mcom.2018.1800181 · Cited by 431
Self-citationSelective Avoidance of Cycles in Irregular LDPC Code Construction
Tian, T., Jones, C. R., Villasenor, J. D., & Wesel, R. D. (2004) · IEEE Transactions on Communications · doi:10.1109/tcomm.2004.833048 · Cited by 387
Erseghe, T. (2016) · IEEE Transactions on Information Theory · doi:10.1109/tit.2016.2616900 · Cited by 159
A class of good quasi-cyclic low-density parity check codes based on progressive edge growth graph
Li, Z., & Kumar, B. V. K. V. (2005) · Asilomar Conference on Signals, Systems and Computers (ACSSC) · doi:10.1109/acssc.2004.1399513 · Cited by 143
Low-Density Parity-Check Codes for ATSC 3.0
Kim, K.-J., Myung, S., Park, S.-I., Lee, J.-Y., Kan, M., Shinohara, Y., Shin, J.-W., & Kim, J. (2016) · IEEE Transactions on Broadcasting · doi:10.1109/tbc.2016.2515538 · Cited by 142
Efficient Algorithm for Finding Dominant Trapping Sets of LDPC Codes
Karimi, M., & Banihashemi, A. H. (2012) · IEEE Transactions on Information Theory · doi:10.1109/tit.2012.2205663 · Cited by 110
Research works printed but not linked: 2
- 2018, Study on Scenarios and Requirements for Next Generation Access
- 2018, NR; Multiplexing Channel Coding (Release 15)
Cited by
Sorted by citations
Tariq, U., & Ahanger, T. A. (2025) · World Electric Vehicle Journal · doi:10.3390/wevj16010024 · Cited by 19
A Novel Scheme for Data Security in AAV Communication Networks for Preventing Data Breach
Zhang, G., Si, R., Ma, C., Ji, B., Wang, W., Mu, Y., Li, Y., & Mumtaz, S. (2025) · IEEE Transactions on Consumer Electronics · doi:10.1109/tce.2025.3542826 · Cited by 1
Self-citationCoding-Shaping Concatenation Scheme for Ultra-Reliable Low-Latency Communications
Luo, Y., & Huang, Q. (2025) · IEEE Transactions on Vehicular Technology · doi:10.1109/tvt.2025.3588412 · Cited by 1
Wang, J., Zou, L., & Li, Y. (2026) · Physical Communication · doi:10.1016/j.phycom.2026.103124 · Cited by 1
Self-citationDu, K.-L., & Swamy, M. N. S. (2026) · Signals and communication technology · doi:10.1007/978-3-032-13094-5_13 · Cited by 1
High-Efficiency Lossy Source Coding Based on Multi-Layer Perceptron Neural Network
Wang, Y., Chen, W., Song, L., Xu, Z., Song, D., & Wang, L. (2025) · Entropy · doi:10.3390/e27101065 · Cited by 1
The Effect of the Punch Function on Error Correcting Codes
Menezla, F., Debbal, M., Bouregaa, M., & Bouamama, R. S. (2024) · International Conference on Embedded & Distributed Systems (EDiS) · doi:10.1109/edis63605.2024.10783386
Parallel Network Structure-aided Neural Shuffled Offset Min-Sum Decoder
Lv, L., Wang, Y., Fang, Y., & Chen, P. (2024) · IEEE Globecom Workshops (GC Wkshps) · doi:10.1109/gcwkshp64532.2024.11100601
Self-citationA Dynamic PAPR Reduction Method Using PTS-ESSA for MIMO Generalized FDM Wireless System
Kumar, S., Samriya, J. K., Tiwari, R., Kumar, M., Harnal, S., Kumar, N., & Guizani, M. (2025) · IEEE Transactions on Network and Service Management · doi:10.1109/tnsm.2025.3619945
A Local Re-Decoding Algorithm for LDPC-Coded Modulation With CCDMs
Yu, H., Song, L., & Wu, Y. (2026) · IEEE Wireless Communications Letters · doi:10.1109/lwc.2026.3651252
Decoding of LDPC Codes Using Singularity of SNR Mismatch Over AWGN Channel
Jeong, H.-J., & Kim, J.-W. (2026) · IEEE Transactions on Green Communications and Networking · doi:10.1109/tgcn.2026.3659107
HDPC Codes with LDPC Matrices: Construction Based on Social Golfer Problem
Shen, Y., Ünal, H. S., & Burg, A. P. (2026) · IEEE International Symposium on Information Theory (ISIT) · doi:10.1109/isit62367.2026.11653623
Metadata
- Authors
- Zou, L., Yan, H., Dong, J., Li, Y., Chen, P., & Lau, F. C. M.
- Affiliations
- Chongqing University (CN)
- Imperial College London (GB)
- Singapore University of Technology and Design (SG)
- Fuzhou University (CN)
- Hong Kong Polytechnic University (HK)
- Venue
- IEEE Transactions on Communications
- Published
- 2024-09
- Volume
- 72
- Issue
- 9
- Pages
- 5290-5301
- ISSN
- 0090-6778 (ISSN-L)
- 1558-0857
- OpenAlex
- W4395056537
- Cited by
- 12
- References
- 21
- Citations by year
- 2026: 5 · 2025: 5 · 2024: 2
- FWCI
- 2.00
- Type
- journal article
- Language
- en
- Open access
- closed
- Licence
- Locations
- IEEE Transactions on Communications (publishedVersion)
- Funders
- China Natural Science Foundation (61771081, 62171135, 62071131)
- Fujian Distinguised project (2022J06010)
- Topics
- Physical Sciences › Computer Science › Computer Networks and Communications › Error Correcting Code Techniques
- Physical Sciences › Mathematics › Discrete Mathematics and Combinatorics › Coding theory and cryptography
- Physical Sciences › Computer Science › Computer Networks and Communications › Advanced Data Storage Technologies
- Keywords
- LDPC codes, ultra-reliable low-latency communication, massive machine-type communications, degree distribution optimization, quadratic residue codes, parity check matrix, masking technique, error correction performance
About these checks
Registry, retraction, Cites and statistics results are computed, not judged, with one exception: a printed reference that no index lists is read once by a model before it counts as a citation error. Claims are extracted by a model and kept only when their quote appears verbatim in the text; each cited source is then checked, with a model’s help, for whether it says what the claim relies on. Those verdicts can be wrong — read the claim’s quote and the cited source before relying on one.
Statistics and arithmetic are recomputed, not judged.
Confidence bands are shown only for fields calibrated on our annotated test set. None is calibrated yet, so no band is shown.
What counts as a claim ›How we measure confidence ›How we check this ›
Are you an author, or do you see a problem with this page? Request a review
