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.