Decoding the (41, 21, 9) Quadratic Residue Code
نویسندگان
چکیده
This paper proposes an algebraic decoding algorithm for the (41, 21, 9) quadratic residue code via Lagrange interpolation formula to determine error check and error locator polynomials. Programs written in C++ language have been executed to check every possible error pattern of this quadratic residue code.
منابع مشابه
Decoding of the ( 41 , 21 , 9 ) Quadratic Residue Code Using the Gao ’ s Algorithm
In this paper, a decoding method is proposed for the (41, 21, 9) quadratic residue code. The method is acquired through applying the condition of the modified Gao’s algorithm that is similar to fast transform decoding developed by Shiozaki [8]. The property of the syndrome polynomial is used in our decoding method. The new algorithm for has been verified by a software simulation using C languag...
متن کاملEfficient Decoding of Systematic (23, 12, 7) and (41, 21, 9) Quadratic Residue Codes
In this paper, a new algorithms decoding the (23, 12, 7) and the (41, 21, 9) Quadratic Residue (QR) codes are presented. The key ideas behind this decoding technique are based on one-to-one mapping between the syndromes “S1” and correctable error patterns. Such algorithms determine the error locations directly by lookup tables without the operations of multiplication over a finite field. Moreov...
متن کاملDecoding Binary Quadratic Residue codes Using the Euclidean Algorithm
A simplified algorithm for decoding binary quadratic residue (QR) codes is developed in this paper. The key idea is to use the efficient Euclidean algorithm to determine the greatest common divisor of two specific polynomials which can be shown to be the error-locator polynomial. This proposed technique differs from the previous schemes developed for QR codes. It is especially simple due to the...
متن کاملOn the Pless Construction and ML Decoding of the Quadratic Residue Code
We present a method for maximumlikelihood decoding of the quadratic residue code This method is based on projecting the code onto a subcode with an acyclic Tanner graph and representing the set of coset leaders by a trellis diagram This results in a two level coset decoding which can be considered a systematic generalization of the Wagner rule We show that unlike the Golay code the code does no...
متن کاملNew Algebraic Decoding of (17,9,5) Quadratic Residue Code by using Inverse Free Berlekamp-Massey Algorithm (IFBM)
In this paper a new algebraic decoding approach for (17,9,5) Quadratic Residue Code is proposed by using the Inverse Free Berlekamp-MasseyAlgorithm i.e. IFBM algorithm. By using an efficient algorithm an unknown syndrome are also developed in this paper. With the help of unknown syndromes, we achieve the alternative consecutive syndromes which are needed for the application of the Berlekamp-Mas...
متن کامل