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 Incremental Redundancy HARQ Scheme for Polar Code
2 Pith papers cite this work. Polarity classification is still indexing.
2
Pith papers citing it
abstract
A polar code extension method which supports incremental redundancy hybrid ARQ(IR-HARQ) is proposed in this paper. By copying information bits to proper positions of the extend part, the extended polar code can give additional protection for the bits weakly protected by the first transmission. A comparison between the proposed algorithm with directly generated polar code, LTE turbo code, and some other IR-HARQ supporting polar code is given. Simulation results show that the proposed algorithm has nearly the same performance as directly generated polar code, which is chosen as base line for comparison.
fields
cs.IT 2years
2026 2representative citing papers
Introduces capacity-aware rateless polar codes with generalized decoding order, nested parity-check construction, and reverse bit-mapping that match fixed-rate coding gain for continuous lengths in IR-HARQ.
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.
-
Beyond 1$\to$N Decoding: Capacity-Aware Rateless Polar Codes for IR-HARQ
Introduces capacity-aware rateless polar codes with generalized decoding order, nested parity-check construction, and reverse bit-mapping that match fixed-rate coding gain for continuous lengths in IR-HARQ.