Efficient Decoding of Systematic (41, 21, 9) Quadratic Residue Code

A new effective lookup table for decoding the binary systematic (41, 21, 9) quadratic residue (QR) code up to 4 errors is presented in this paper. The key ideas behind this decoding technique are based on one to one mapping between the syndromes ldquoS1rdquo and the error correctable patterns. Such an algorithm determines the error locations directly by lookup tables without the operations of multiplication over a finite field. Moreover, the methods to dramatically reduce the memory requirement are given. The new algorithm has been verified through a software simulation by C language. The new approach is modular, regular and naturally suitable for SOC software implementation.