arXiv (All)
open access
Partitioned Successive-Cancellation List Decoding of Polar Codes
Successive-cancellation list (SCL) decoding is an algorithm that provides very good error-correction performance for polar codes. However, its hardware implementation requires a large amount of memory, mainly to store intermediate results. In this paper, a partitioned SCL algorithm is proposed to re
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
- Cryptography based on error correcting codes#460193
- On the relation between A-codes and codes correcting independent errors#1107271
- Error-Correcting Weakly Constrained Codes: Constructions and Achievable Rates#792748
- ECMA-222 — Adaptive lossless data compression algorithm (June 1995)#600393
- Statistical mechanics of error-correcting codes#230064
Record · ID 1061536
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