arXiv (All)
open access
Learning LDPC codes with density evolution over relaxed protographs
We consider the design of low-density parity-check (LDPC) codes for a given iterative decoder. While LDPC performance can be evaluated using simulation, density evolution (DE), or EXIT-chart analysis, selecting a parity-check matrix (PCM) remains a difficult combinatorial optimization problem. Exist
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
- Low-Latency LDPC Decoding Based on Consensus and Return Residual Belief Propagation#1325283
- Constant-time decoding of Gabidulin codes and their generalizations with application to RQC#394329
- Stability of Quantum LDPC States under Local Pauli Noise#1358012
- Breaking the Orthogonality Barrier in Quantum LDPC Codes#986189
- Near-optimal high-rate surgery from linear PCPPs#1063184
Record · ID 1202144
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