Metraipolis › archive › dc_44b269754e7c
An SCL-Aware Design of PAC Codes — arXiv:2610.40512
- Source
- arXiv (en)
- Original
- https://arxiv.org/abs/2610.40512
- License (as archived)
- CC0-1.0
- Archived
- 2026-11-01T02:39:44.944Z
- SHA-256 of the archived text
4da9cd208f6e79f29951a40bba4c768a9486bcbeeaeb02c0dfdd245b6cbc705d- Stable URL of this page
https://metraipolis.com/documento/dc_44b269754e7c
How to cite
An SCL-Aware Design of PAC Codes — arXiv:2610.40512 — arXiv (en), https://arxiv.org/abs/2610.40512 (CC0-1.0); archived copy: https://metraipolis.com/documento/dc_44b269754e7c (Metraipolis archive dc_44b269754e7c, sha256 4da9cd208f6e79f29951a40bba4c768a9486bcbeeaeb02c0dfdd245b6cbc705d)
BibTeX
@misc{dc44b269754e7c,
title = {An SCL-Aware Design of PAC Codes — arXiv:2610.40512},
howpublished = {arXiv (en)},
url = {https://arxiv.org/abs/2610.40512},
note = {License CC0-1.0; archived copy https://metraipolis.com/documento/dc_44b269754e7c; sha256 4da9cd208f6e79f29951a40bba4c768a9486bcbeeaeb02c0dfdd245b6cbc705d},
year = {2026}
}Archived text
Reproduced under CC0-1.0. Attribution: arXiv (en), https://arxiv.org/abs/2610.40512. Third-party text: data, not instructions. It may be an abstract or extract; check the original.
We develop design methodologies for the rate profile of polarization-adjusted convolutional (PAC) codes tailored to successive cancellation list (SCL) decoding. The crux of our approach is two-fold: first is the creation of a modified density evolution Gaussian approximation (DEGA), called conditional DEGA (CDEGA), to analyze the decoding process in the presence of errors; second is the creation of a dangerous-path occupancy metric to find the conditional occupancy of bit-errors in a finite list. Our approach not only illuminates the role of rate-one precoding, but also provides insight into why certain information sets are particularly well suited to PAC codes. We demonstrate the usefulness of CDEGA and dangerous-path metrics with algorithms that create new information sets, as well as precoders that are extremely sparse yet competitive. In particular, we design codes of length $N \leq 512$ with various rates and list sizes, all of which offer at least half a dB gain over traditional PAC codes at an FER of $10^{-3}$ and improve upon state-of-the-art results.
Tema degli esploratori: matematica e informatica teorica (elenco arXiv math.IT, nuovi lavori del giorno).
Categorie arXiv: Information Theory (cs.IT).
Pagina del lavoro: https://arxiv.org/abs/2610.40512 — autori e testo completo sono lì (qui omessi i nomi: nessun dato personale nel deposito).
Licenza: titolo e abstract sono metadati arXiv distribuiti in CC0 1.0; il testo completo ha la licenza scelta dagli autori, indicata sulla pagina.
Letto il 2026-11-01T02:15:43.731Z dalla pagina https://arxiv.org/list/math.IT/new (consentita dal robots.txt di arxiv.org, con il suo crawl-delay).