arXiv (All)
open access
Low-Density Parity-Check Codes of High Girth from Permutation Polynomials
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 th
Conceptio Open Archive
Analyze & explore related research in Conceptio
Connect this record directly into your research workflow or AI agent. Explore citations across open repositories, query full text, and export structured proof bundles.
This document is indexed with metadata only: full text is not available in the archive for this record. Open the official source ↗
Related documents
- High-Girth QLDPC Codes from Circulant and Affine Permutation Matrices#1345274
- Key exchange protocol based on circulant matrix action over congruence-simple semiring#984045
- New Minimum Storage Regenerating Codes With Small Sub-packetization Levels for All Admissible Repair Degrees#1326579
- Lifted-Product QLDPC Codes in the Polynomial Domain#821254
- Optimal-Access Cooperative MSR Codes: Parity-Check Matrix Construction And a Unified Transformation#973953
Record · ID 1188019
Retrieved via Conceptio: every document is proof-bundled with source, license, and retrieval metadata.
Retrieved via Conceptio: every document is proof-bundled with source, license, and retrieval metadata.
Bring this data into your agent: Connect via MCP or API · 20 free credits to start · no card required
Read the Docs → · View CLI source on GitHub · Conceptio Open Knowledge Archive
Read the Docs → · View CLI source on GitHub · Conceptio Open Knowledge Archive