arXiv (All)
open access
Fast List Decoders for Polar Codes
Polar codes asymptotically achieve the symmetric capacity of memoryless channels, yet their error-correcting performance under successive-cancellation (SC) decoding for short and moderate length codes is worse than that of other modern codes such as low-density parity-check (LDPC) codes. Of the many
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
- Fast-SSC-Flip Decoding of Polar Codes#1061545
- Decoder-Preserving Sparse Autoencoders: Which Readouts Survive Sparse Compression?#1084296
- Why is Listing's Law Revisited Now?#69596
- Search for Supersymmetry in Events with Photons and Low Missing Transverse Energy in pp Collisions at √s = 7 TeV#367730
- Search for supersymmetry with razor variables in pp collisions at sqrt(s)=7 TeV#624994
Record · ID 1061534
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