Optimization of CRC-Based Single-Bit Error Correction Using a Perfect Hash Table Structure
This work introduces a novel approach for correcting a single-bit error in a CRC-protected message, which is based on a perfect hash table that can be queried by a non-zero CRC syndrome. The paper primarily focuses on presenting the new table structure and includes a comparative analysis of various CRC-based error correction methods, demonstrating that ours strikes an excellent balance between correction complexity and memory requirements. Complexity evaluation is performed in terms of the number of 2-input gate operations.
Authors
- Patrick Corlay (ORCID: https://orcid.org/0000-0002-3407-8805)
- François‐Xavier Coudoux (ORCID: https://orcid.org/0000-0002-5817-7429)
- Stéphane Coulombe (ORCID: https://orcid.org/0000-0003-4495-3906)
- Zouhair Ziani
Institutions
- Centre National de la Recherche Scientifique (FR)
- Institut d'Electronique, de Microélectronique et de Nanotechnologie (FR)
- Université Polytechnique Hauts-de-France (FR)
- École de Technologie Supérieure (CA)
Publication Details
- Published
- 2025-05-25
- DOI
- https://doi.org/10.1109/iscas56072.2025.11043197
- Primary Topic
- Coding theory and cryptography
- Type
- article
- Field-Weighted Citation Impact
- 0.00
Funders
- Natural Sciences and Engineering Research Council of Canada