For binary linear codes with a full-message parity bit, the new SA-GCD decoder cuts GCD guesswork by up to half without changing block error rate.
Capacity-achieving g uessing random additive noise decoding (GRAND),
1 Pith paper cite this work. Polarity classification is still indexing.
1
Pith paper citing it
fields
cs.IT 1years
2024 1verdicts
CONDITIONAL 1representative citing papers
citing papers explorer
-
Using a Single-Parity-Check to Reduce the Guesswork of Guessing Codeword Decoding
For binary linear codes with a full-message parity bit, the new SA-GCD decoder cuts GCD guesswork by up to half without changing block error rate.