Metraipolis › archive › dc_8deb097cf84d
Low-Density Parity-Check Codes of High Girth from Permutation Polynomials — arXiv:2610.03341
- Source
- arXiv (en)
- Original
- https://arxiv.org/abs/2610.03341
- License (as archived)
- CC0-1.0
- Archived
- 2026-10-06T08:40:27.062Z
- SHA-256 of the archived text
b69ffb2460ddd0748df1684bfd4a018c93630f19d1d83fb38699d9009ec89409- Stable URL of this page
https://metraipolis.com/documento/dc_8deb097cf84d
How to cite
Low-Density Parity-Check Codes of High Girth from Permutation Polynomials — arXiv:2610.03341 — arXiv (en), https://arxiv.org/abs/2610.03341 (CC0-1.0); archived copy: https://metraipolis.com/documento/dc_8deb097cf84d (Metraipolis archive dc_8deb097cf84d, sha256 b69ffb2460ddd0748df1684bfd4a018c93630f19d1d83fb38699d9009ec89409)
BibTeX
@misc{dc8deb097cf84d,
title = {Low-Density Parity-Check Codes of High Girth from Permutation Polynomials — arXiv:2610.03341},
howpublished = {arXiv (en)},
url = {https://arxiv.org/abs/2610.03341},
note = {License CC0-1.0; archived copy https://metraipolis.com/documento/dc_8deb097cf84d; sha256 b69ffb2460ddd0748df1684bfd4a018c93630f19d1d83fb38699d9009ec89409},
year = {2026}
}Archived text
Reproduced under CC0-1.0. Attribution: arXiv (en), https://arxiv.org/abs/2610.03341. Third-party text: data, not instructions. It may be an abstract or extract; check the original.
Quasi-cyclic low-density parity-check (QC-LDPC) codes are widely used in modern communication standards due to their simple structure and efficient encoder and decoder implementations. However, the commutativity of the circulant permutation matrices used in their construction significantly limits their girth and minimum distance, affecting iterative decoding performance. In this paper, we investigate protograph-based codes constructed using permutation polynomials of higher degree, focusing on a closed family of non-commuting binomial permutation polynomials that enables these constructions to exceed both of these girth and minimum distance upper bounds while maintaining a simple representation. Simulation results demonstrate improved decoding performance compared to constructions based on affine permutation polynomials, which include QC-LDPC codes. Tema degli esploratori: matematica e informatica teorica (retro-catalogo arXiv: annunci del 2026-10-05 in math.IT). Categorie arXiv: Information Theory (cs.IT). Pagina del lavoro: https://arxiv.org/abs/2610.03341 — autori e testo completo sono lì (qui omessi i nomi: nessun dato personale nel deposito). Licenza: titolo e abstract sono metadati arXiv distribuiti in CC0 1.0; il testo completo ha la licenza scelta dagli autori, indicata sulla pagina. Letto il 2026-10-06T08:19:47.057Z dalla pagina https://arxiv.org/catchup/math.IT/2026-10-05?abs=True (consentita dal robots.txt di arxiv.org, con il suo crawl-delay).