PAC codes match polar secrecy bounds while improving reliability and both provide tighter finite-length semantic secrecy than invertible-extractor schemes over the wiretap BSC.
From sequential decoding to channel polarization and back again
3 Pith papers cite this work. Polarity classification is still indexing.
3
Pith papers citing it
citation-role summary
background 1
citation-polarity summary
fields
cs.IT 3years
2026 3verdicts
UNVERDICTED 3roles
background 1polarities
background 1representative citing papers
Feedback enables genie-aided SC decoding and flexible thresholds that significantly improve finite-length performance of polar codes, with a new characterization of the error event distribution.
The SO-FSCL algorithm extends fast SCL decoding to provide soft outputs for polar codes with major reductions in latency and complexity and near-identical performance to conventional SO-SCL.
citing papers explorer
-
Finite-Length Empirical Comparison of Polar, PAC, and Invertible-Extractor Secrecy Codes over the Wiretap BSC
PAC codes match polar secrecy bounds while improving reliability and both provide tighter finite-length semantic secrecy than invertible-extractor schemes over the wiretap BSC.
-
On Polar Coding with Feedback
Feedback enables genie-aided SC decoding and flexible thresholds that significantly improve finite-length performance of polar codes, with a new characterization of the error event distribution.
-
Node-Based Soft-Output Fast Successive Cancellation List Decoding of Polar Codes
The SO-FSCL algorithm extends fast SCL decoding to provide soft outputs for polar codes with major reductions in latency and complexity and near-identical performance to conventional SO-SCL.