A copy of this work was available on the public web and has been preserved in the Wayback Machine. The capture dates from 2020; you can also visit the original URL.
The file type is application/pdf.
An application of bivariate polynomial factorization on decoding of Reed-Solomon based codes
2018
Applicable Analysis and Discrete Mathematics
Preserved Fulltext
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
doi:10.2298/aadm170530005p
fatcat:4kt6mghbmvgwbj5ysrkyylsoti