AN APPLICATION OF BIVARIATE POLYNOMIAL FACTORIZATION ON DECODING OF REED-SOLOMON BASED CODES

A necessary and sufficient condition for the existence of a non-trivial factorization of an arbitrary bivariate polynomial with integer coefficients was presented in [2]. In this paper we develop an efficient algorithm for factoring bivariate polynomials with integer coefficients. Also, we shall give a proof of the optimality of the algorithm. For a given codeword, formed by mixing up two codewords, the algorithm recovers those codewords directly by factoring corresponding bivariate polynomial. Our algorithm determines uniquely the given polynomials which are used in forming the mixture of two codewords.