In this study, we investigate the characteristics of scheduling sequences that enable efficient decoding of generalized low-density parity-check (GLDPC) codes under the layered message-passing algorithm. In particular, we show that scheduling sequences leading to higher decoding efficiency should prioritize the update of constraint nodes corresponding to subcodes with larger minimum distance, fewer minimum-weight codewords, and shorter code length. Based on these characteristics, we design a scheduling algorithm, which further demonstrates the effectiveness of these characteristics through simulation experiments.
@article{arxiv.2604.23119,
title = {Analysis of Efficient Scheduling in Layered Decoding of GLDPC Codes},
author = {Qingqing Peng and Dongxu Chang and Guiying Yan and Guanghui Wang},
journal= {arXiv preprint arXiv:2604.23119},
year = {2026}
}