arXiv (All)
open access
Limits of Weight-Bounded Redundant Checks for Peeling Decoding of Random Regular LDPC Codes
We study peeling decoding on the binary erasure channel when redundant parity checks may be added without restriction in number, but each check is subject to a row-weight constraint. For random simple binary regular low-density parity-check (LDPC) codes, we consider the parity-check matrix formed by
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
- Statistical mechanics of broadcast channels using low-density parity-check codes#230080
- Low-Latency LDPC Decoding Based on Consensus and Return Residual Belief Propagation#1325283
- Critical noise levels for LDPC decoding#978338
- Improved rate-compatible low-density parity-check codes with applications to wireless channels#284559
- A Note on Sphere Packing Bounds for Tuple Lattice Sieving#985566
Record · ID 1201273
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