Ultrafast Codes for Multiple Adjacent Error Correction and Double Error Detection

Optimal codes for single-error correction, double-adjacent-error detection

In certain memory systems the most common error is a single error and the next most common error is two errors in positions which are stored physically adjacent in the memory. In this correspondence we present optimal codes for recovering from such errors. We correct single errors and detect double adjacent errors. For detecting adjacent errors we consider codes which are byte-organized. In the...

Low-cost single error correction multiple adjacent error correction codes

Soft errors that affect flip-flops are a major issue in advanced electronic circuits. As technology scales, multiple bit errors become more likely. This limits the applicability of traditional protection techniques like triplication with voting or single error correction codes that can correct only one error. Multiple errors tend to affect adjacent bits, and therefore it is interesting to use e...

Design of Single Error Correction-Double Adjacent Error Detection-Triple Adjacent Error Detection-Tetra Adjacent Error Detection (Sec-Daed-Taed- Tetra Aed) Codes

Error correction codes are used in semiconductor memories to protect information against soft and hard errors. Soft error is a major concern for memory reliability especially for memories that are used in space applications. Hamming codes are attractive as they are simple to construct for any word length and encoding / decoding can be done with low latency. In this paper, the design of Single E...

Quantum Error-Correction Codes on Abelian Groups

We prove a general form of bit flip formula for the quantum Fourier transform on finite abelian groups and use it to encode some general CSS codes on these groups.

Protection of On-chip Memory Systems against Multiple Cell Upsets Using Double-adjacent Error Correction Codes