arXiv (OAI Expanded)
open access
CPM-LDPC Codes Attaining the Minimum-Distance Bound
We study binary quasi-cyclic LDPC codes whose parity-check matrices are full arrays of single circulant permutation matrices (CPMs), referred to here as CPM-LDPC codes. Their minimum distance is at most $(J+1)!$, where $J$ is the column weight. For every fixed pair of column and row weights $2\le J<
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
- On neighbor distances and symmetry in group codes#490081
- Optimal-Access Cooperative MSR Codes: Parity-Check Matrix Construction And a Unified Transformation#973953
- Shortest self-orthogonal embeddings of binary linear codes#925845
- On the Minimum Distance of Generalized Spatially Coupled LDPC Codes#418132
- On Twisted Roth-Lempel Codes#1123676
Record · ID 1122830
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