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.

翻译：本研究探讨了在分层消息传递算法下，能够实现广义低密度奇偶校验（GLDPC）码高效译码的调度序列特性。特别地，我们证明：带来更高译码效率的调度序列应优先更新与具有更大最小距离、更少最小重量码字及更短编码长度的子码对应的约束节点。基于这些特性，我们设计了一种调度算法，并通过仿真实验进一步验证了这些特性的有效性。