Proves that PAC codes with rate profiles below polarized cutoff rates have Pareto-bounded sequential decoding complexity, and demonstrates a code built on this rule that gains over 0.75 dB at FER 1e-5.
On sequential decoding metric function of polarization- adjusted convolutional (PAC) codes,
1 Pith paper cite this work. Polarity classification is still indexing.
1
Pith paper citing it
citation-role summary
method 1
citation-polarity summary
fields
cs.IT 1years
2024 1verdicts
CONDITIONAL 1roles
method 1polarities
use method 1representative citing papers
citing papers explorer
-
PAC codes with Bounded-Complexity Sequential Decoding: Pareto Distribution and Code Design
Proves that PAC codes with rate profiles below polarized cutoff rates have Pareto-bounded sequential decoding complexity, and demonstrates a code built on this rule that gains over 0.75 dB at FER 1e-5.