IEICE TRANSACTIONS on Fundamentals
Factorization of String Polynomials
Summary :
A factorization method for a string polynomial called the constant method is proposed. This uses essentially three operations; classification of monomials, gcrd (greatest common right divisor), and lcrm (least common rigth multiple). This method can be applied to string polynomials except that their constants cannot be reduced to zeros by the linear transformation of variables. To factorize such excluded string polynomials, the naive method is also presented, which computes simply coefficients of two factors of a given polynomial, but is not efficient.
- Publication
- IEICE TRANSACTIONS on Fundamentals Vol.E80-A No.4 pp.670-681
- Publication Date
- 1997/04/25
- Publicized
- Online ISSN
- DOI
- Type of Manuscript
- Special Section PAPER (Special Section on Discrete Mathematics and Its Applications)
- Category
Authors
Keyword
Latest Issue
Copyrights notice of machine-translated contents
The copyright of the original papers published on this site belongs to IEICE. Unauthorized use of the original or translated papers is prohibited. See IEICE Provisions on Copyright for details.
Cite this
Copy
Kazuyoshi MORI, Saburou IIDA, "Factorization of String Polynomials" in IEICE TRANSACTIONS on Fundamentals,
vol. E80-A, no. 4, pp. 670-681, April 1997, doi: .
Abstract: A factorization method for a string polynomial called the constant method is proposed. This uses essentially three operations; classification of monomials, gcrd (greatest common right divisor), and lcrm (least common rigth multiple). This method can be applied to string polynomials except that their constants cannot be reduced to zeros by the linear transformation of variables. To factorize such excluded string polynomials, the naive method is also presented, which computes simply coefficients of two factors of a given polynomial, but is not efficient.
URL: https://global.ieice.org/en_transactions/fundamentals/10.1587/e80-a_4_670/_p
Copy
@ARTICLE{e80-a_4_670,
author={Kazuyoshi MORI, Saburou IIDA, },
journal={IEICE TRANSACTIONS on Fundamentals},
title={Factorization of String Polynomials},
year={1997},
volume={E80-A},
number={4},
pages={670-681},
abstract={A factorization method for a string polynomial called the constant method is proposed. This uses essentially three operations; classification of monomials, gcrd (greatest common right divisor), and lcrm (least common rigth multiple). This method can be applied to string polynomials except that their constants cannot be reduced to zeros by the linear transformation of variables. To factorize such excluded string polynomials, the naive method is also presented, which computes simply coefficients of two factors of a given polynomial, but is not efficient.},
keywords={},
doi={},
ISSN={},
month={April},}
Copy
TY - JOUR
TI - Factorization of String Polynomials
T2 - IEICE TRANSACTIONS on Fundamentals
SP - 670
EP - 681
AU - Kazuyoshi MORI
AU - Saburou IIDA
PY - 1997
DO -
JO - IEICE TRANSACTIONS on Fundamentals
SN -
VL - E80-A
IS - 4
JA - IEICE TRANSACTIONS on Fundamentals
Y1 - April 1997
AB - A factorization method for a string polynomial called the constant method is proposed. This uses essentially three operations; classification of monomials, gcrd (greatest common right divisor), and lcrm (least common rigth multiple). This method can be applied to string polynomials except that their constants cannot be reduced to zeros by the linear transformation of variables. To factorize such excluded string polynomials, the naive method is also presented, which computes simply coefficients of two factors of a given polynomial, but is not efficient.
ER -
English
