Probabilistic sha** for trellis-coded modulation with CRC-aided list decoding

L Wang, D Song, F Areces, T Wiegart… - IEEE Transactions on …, 2023 - ieeexplore.ieee.org
This paper applies probabilistic amplitude sha** (PAS) to cyclic redundancy check (CRC)-
aided tail-biting trellis-coded modulation (TCM). CRC-TCM-PAS produces practical codes …

Performance improvement of space missions using convolutional codes by CRC-aided list Viterbi algorithms

R Schiavone, R Garello, G Liva - IEEE Access, 2023 - ieeexplore.ieee.org
Recently, CRC-aided list decoding of convolutional codes has gained attention thanks to its
remarkable performance in the short blocklength regime. This paper studies the …

Achieving short-blocklength RCU bound via CRC list decoding of TCM with probabilistic sha**

L Wang, D Song, F Areces… - ICC 2022-IEEE …, 2022 - ieeexplore.ieee.org
This paper applies probabilistic amplitude sha** (PAS) to a cyclic redundancy check
(CRC) aided trellis coded modulation (TCM) to achieve the short-blocklength random coding …

ELF codes: Concatenated codes with an expurgating linear function as the outer code

R Wesel, A Antonini, L Wang, W Sui… - … on Topics in Coding …, 2023 - ieeexplore.ieee.org
An expurgating linear function (ELF) is an outer code that disallows low-weight codewords
of the inner code. ELFs can be designed either to maximize the minimum distance or to …

Efficient List Decoding for Short Blocklength Communication

BH Towell - 2024 - search.proquest.com
At short blocklengths, well designed zero-terminated (ZT) and tail-biting (TB) convolutional
codes (CCs) concatenated with cyclic redundancy check (CRC) codes have been shown to …

[BOOK][B] Low-Complexity Decoding of Low-Density Parity Check Codes Through Optimal Quantization and Machine Learning and Optimal Modulation and Coding for …

L Wang - 2023 - search.proquest.com
UNIVERSITY OF CALIFORNIA Los Angeles Low-Complexity Decoding of Low-Density Parity
Check Codes Through Optimal Quantization and Page 1 UNIVERSITY OF CALIFORNIA Los …