arXiv (All)
open access
Capacity-Achieving BBT Polar Codes with Interleaver-Assisted BP Decoding
In this paper, we introduce a binary balanced tree (BBT) channel transformation that extends Arıkan's channel transformation to arbitrary block lengths. We prove that the proposed transformation induces channel polarization, thereby establishing that BBT polar codes achieve the capacity of binary-in
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
- Reed-Solomon Codes with Optimal Repair Bandwidth: A Basis-Transformation Approach#1389166
- RTP Payload Format for the Extended Adaptive Multi-Rate Wideband (AMR-WB+) Audio Codec#500602
- Efficient Polynomial-Time Decoding of Simplicial Anticodes with Near-Optimal Performance#798271
- Efficient Polynomial-Time Decoding of Simplicial Anticodes with Near-Optimal Performance#796858
- Coded Fourier-Curve Constellations with Tangent Artificial Noise: Covariance-Aware Demapping, Complexity, and Key Sensitivity#1069789
Record · ID 1386253
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