Efficient Software Method for Decoding of the (71, 36, 11) Quadratic Residue Code

In this paper presents an efficient table lookup algorithm for high-throughput decoding of the (71, 36, 11) Quadratic Residue (QR) code. The main ideas behind this decoding technique are based on one-to-one mapping between the syndromes "S1" and correctable error patterns. As compared with the binary lookup table method, the presented technique is faster than binary searching method for finding error pattern. In addition, it has the advantage that only the operations of addition over a Finite Field are used for decoding QR codes. Moreover, the presented high speed of the decoding procedure has potential applications in modern communication systems and digital signal processing (DSP) systems.