Issue No. 05 - May (1987 vol. 36)

ISSN: 0018-9340

pp: 634-637

A. Mukhopadhyay , Department of Computer Science, Concordia University

ABSTRACT

The polynomial Hensel code of a rational function a(x)/ b(x) ? F(x), F is a field, is the pair (c(x) d-1(x) mod Xr, n); r is a positive integer and a(x)/ b(x) = (c(x))xn such that c(x) and d(x) have nonzero constant terms. Such a representation scheme was proposed, in analogy with the Hensel code representations of rational numbers, to facilitate arithmetic operations on rational functions and control intermediate expressions well. The difficulty with this scheme was the conversion of such a code to rational function form. In this correspondence, we have given sufficient conditions under which this can be done and have described an algorithm for effecting the conversion. We have also discussed an application, namely, the reduction of a rational function to its simplest form.

INDEX TERMS

rational function representation, Algebraic simplification, algorithm design, Euclidean algorithm, Hensel code

CITATION

A. Mukhopadhyay, "A Solution to the Polynomial Hensel Code Conversion Problem",

*IEEE Transactions on Computers*, vol. 36, no. , pp. 634-637, May 1987, doi:10.1109/TC.1987.1676950