Scheduling sequences that prioritize constraint nodes tied to subcodes with larger minimum distance, fewer minimum-weight codewords, and shorter length yield higher efficiency in layered decoding of GLDPC codes.
A novel base graph based static scheduling scheme for layered decoding of 5G LDPC codes,
1 Pith paper cite this work. Polarity classification is still indexing.
1
Pith paper citing it
fields
cs.IT 1years
2026 1verdicts
UNVERDICTED 1representative citing papers
citing papers explorer
-
Analysis of Efficient Scheduling in Layered Decoding of GLDPC Codes
Scheduling sequences that prioritize constraint nodes tied to subcodes with larger minimum distance, fewer minimum-weight codewords, and shorter length yield higher efficiency in layered decoding of GLDPC codes.