BBT polar codes achieve capacity for any block length via a new tree transformation and support low-latency BP decoding through interleaving and sub-graph processing.
An adaptive IR-HARQ scheme for polar codes by polarizing matrix extension
1 Pith paper cite this work. Polarity classification is still indexing.
1
Pith paper citing it
fields
cs.IT 1years
2026 1verdicts
CONDITIONAL 1representative citing papers
citing papers explorer
-
Capacity-Achieving BBT Polar Codes with Interleaver-Assisted BP Decoding
BBT polar codes achieve capacity for any block length via a new tree transformation and support low-latency BP decoding through interleaving and sub-graph processing.