arXiv (All)
open access
Increasing the Speed of Polar List Decoders
In this work, we present a simplified successive cancellation list decoder that uses a Chase-like decoding process to achieve a six time improvement in speed compared to successive cancellation list decoding while maintaining the same error-correction performance advantage over standard successive-c
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
- Leveraging Code Structure to Improve Soft Output for GRAND, GCD, OSD, and SCL#1105900
- ECMA-151 — Data compression for information interchange - Adaptive coding with embedded dictionary - DCLZ algorithm (June 1991)#600454
- xPress: Parallel Refinement for Diffusion Drafters in Speculative Decoding#424016
- Decoupling Vector Data and Index Storage for Space Efficiency#196468
- Decoupling Vector Data and Index Storage for Space Efficiency#6042
Record · ID 1061531
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