1 citations · 1 across the 7 of their papers we have counts for
Showing 2026Show all
2 papers · 1 filter
cs.CC2026
On the Intractability of the Minimum Distance Problem for Regular LDPC Codes
Chenyuan Jia, Qingqing Peng, Ke Liu +2
The minimum distance problem (MDP) for low-density parity-check (LDPC) codes is a central problem in coding theory and is closely related to the analysis of low-weight codewords an…
cs.IT2026
Analysis of Efficient Scheduling in Layered Decoding of GLDPC Codes
Qingqing Peng, Dongxu Chang, Guiying Yan +1
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 mes…