On the High-Rate FDPC Codes: Construction, Encoding, and a Generalization
Fuente:
arXiv
Saved in:
| Main Authors: | , , |
|---|---|
| Format: | Preprint |
| Published: |
2025
|
| Subjects: | |
| Online Access: | |
| Tags: |
Add Tag
No Tags, Be the first to tag this record!
|
| _version_ | 1866908406382592000 |
|---|---|
| author | Moradi, Mohsen Rabeti, Sheida Mahdavifar, Hessam |
| author_facet | Moradi, Mohsen Rabeti, Sheida Mahdavifar, Hessam |
| contents | Recently introduced Fair-Density Parity-Check (FDPC) codes, targeting high-rate applications, offer superior error-correction performance (ECP) compared to 5G Low-Density Parity-Check (LDPC) codes, given the same number of message-passing decoding iterations. In this paper, we present a novel construction method for FDPC codes, introduce a generalization of these codes, and propose a low-complexity encoding algorithm. Numerical results demonstrate the fast convergence of the message-passing decoder for FDPC codes. |
| format | Preprint |
| id |
arxiv_https___arxiv_org_abs_2506_11345 |
| institution | arXiv |
| publishDate | 2025 |
| record_format | arxiv |
| spellingShingle | On the High-Rate FDPC Codes: Construction, Encoding, and a Generalization Moradi, Mohsen Rabeti, Sheida Mahdavifar, Hessam Information Theory Recently introduced Fair-Density Parity-Check (FDPC) codes, targeting high-rate applications, offer superior error-correction performance (ECP) compared to 5G Low-Density Parity-Check (LDPC) codes, given the same number of message-passing decoding iterations. In this paper, we present a novel construction method for FDPC codes, introduce a generalization of these codes, and propose a low-complexity encoding algorithm. Numerical results demonstrate the fast convergence of the message-passing decoder for FDPC codes. |
| title | On the High-Rate FDPC Codes: Construction, Encoding, and a Generalization |
| topic | Information Theory |
| url | https://arxiv.org/abs/2506.11345 |