Analysis of Efficient Scheduling in Layered Decoding of GLDPC Codes
Fuente:
arXiv
Guardado en:
| Autores principales: | , , , |
|---|---|
| Formato: | Preprint |
| Publicado: |
2026
|
| Materias: | |
| Acceso en línea: | |
| Etiquetas: |
Agregar Etiqueta
Sin Etiquetas, Sea el primero en etiquetar este registro!
|
| _version_ | 1866911622546587648 |
|---|---|
| author | Peng, Qingqing Chang, Dongxu Yan, Guiying Wang, Guanghui |
| author_facet | Peng, Qingqing Chang, Dongxu Yan, Guiying Wang, Guanghui |
| contents | 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. |
| format | Preprint |
| id |
arxiv_https___arxiv_org_abs_2604_23119 |
| institution | arXiv |
| publishDate | 2026 |
| record_format | arxiv |
| spellingShingle | Analysis of Efficient Scheduling in Layered Decoding of GLDPC Codes Peng, Qingqing Chang, Dongxu Yan, Guiying Wang, Guanghui Information Theory 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. |
| title | Analysis of Efficient Scheduling in Layered Decoding of GLDPC Codes |
| topic | Information Theory |
| url | https://arxiv.org/abs/2604.23119 |