CRC Codes as Error Correction Codes
Wei An, Muriel M\'edard, Ken R. Duffy

TL;DR
This paper demonstrates that CRC codes, traditionally used for error detection, can be effectively employed for error correction using GRAND decoding, outperforming some existing codes in short, high-rate scenarios.
Contribution
The paper introduces the use of GRAND decoding with CRC codes for error correction, showing it matches or exceeds the performance of established codes like BCH and CA-Polar in certain settings.
Findings
CRC codes with GRAND achieve error correction comparable to BCH codes.
CRC outperforms Polar and CA-Polar codes in short, high-rate scenarios.
GRAND enables low-latency error correction without re-engineering encoders.
Abstract
CRC codes have long since been adopted in a vast range of applications. The established notion that they are suitable primarily for error detection can be set aside through use of the recently proposed Guessing Random Additive Noise Decoding (GRAND). Hard-detection (GRAND-SOS) and soft-detection (ORBGRAND) variants can decode any short, high-rate block code, making them suitable for error correction of CRC-coded data. When decoded with GRAND, short CRC codes have error correction capability that is at least as good as popular codes such as BCH codes, but with no restriction on either code length or rate. The state-of-the-art CA-Polar codes are concatenated CRC and Polar codes. For error correction, we find that the CRC is a better short code than either Polar or CA-Polar codes. Moreover, the standard CA-SCL decoder only uses the CRC for error detection and therefore suffers severe…
Peer Reviews
No public reviews on file for this paper yet. If you reviewed it on a platform where reviews are public (OpenReview, ICLR, NeurIPS, ICML), you can paste yours below so the community can read it here.
Videos
No videos yet. Explain this paper in a talk, walkthrough, or lecture? Add one.
