Skip to content
DraconiticResearch
Search Sources API
197,768 studies31 sourcesUpdated 7 min ago
PreprintCC BY 4.0arXiv

Low-Density Parity-Check Codes of High Girth from Permutation Polynomials

  • Tasawwar Hussain
  • Anthony Gómez-Fonseca
  • Tefjol Pllaha
Open at sourcePDFDOICite

Abstract

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.

Related

  1. Breakeven demonstration of quantum low-density parity-check codes
    Edwin Tham, Michael L. Goldman, Shantanu Debnath +8
    arXivPreprintCC BY 4.0Full textGeneral mathematicsQuantum physics & quantum informationarXiv
  2. Quantum LDPC and High-Rate CSS Codes from Fair-Density Parity-Check Codes
    Hessam Mahdavifar
    arXivPreprintarXiv licenceFull textGeneral mathematicsarXiv
  3. Optimal-Access Cooperative MSR Codes: Parity-Check Matrix Construction And a Unified Transformation
    Yaqian Zhang, Jingke Xu, Ya-Feng Liu
    arXivPreprintarXiv licenceFull textGeneral mathematicsarXiv
  4. Enumeration of certain permutation group polynomials
    Sartaj Ul Hasan, Ramandeep Kaur, Hridesh Kumar
    arXivPreprintCC BY 4.0Full textCombinatorics & discrete mathematicsarXiv
  5. New classes of trace-form permutation polynomials and their compositional inverses
    Kirpa Garg
    arXivPreprintarXiv licenceFull textAlgebra & number theoryarXiv

Cite

BibTeXRIS
BibTeX
@misc{hussain2026lowdensity,
  title = {{Low-Density Parity-Check Codes of High Girth from Permutation Polynomials}},
  author = {Tasawwar Hussain and Anthony Gómez-Fonseca and Tefjol Pllaha},
  howpublished = {arXiv},
  year = {2026},
  month = oct,
  doi = {10.48550/arxiv.2610.03341},
  eprint = {2610.03341},
  archivePrefix = {arXiv},
  url = {https://arxiv.org/abs/2610.03341},
  note = {CC BY 4.0},
}
RIS
TY  - UNPB
TI  - Low-Density Parity-Check Codes of High Girth from Permutation Polynomials
AU  - Tasawwar Hussain
AU  - Anthony Gómez-Fonseca
AU  - Tefjol Pllaha
PY  - 2026
DA  - 2026/10/02
PB  - arXiv
DO  - 10.48550/arxiv.2610.03341
UR  - https://arxiv.org/abs/2610.03341
AB  - 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.
ER  -