Conjugating Polynomials on Finite Rings
Let R be a finite commutative ring, and let f : R ~ R. We call f a polynomial of degree n if there are a O, a t. a 2 ..... a~ ~ R, an ~ 0, such that for all t ~ R, we have f(t) = a 0 +air+ a2 t2 +...+ a~tt n. Such polynomials play an important role in coding theory, the logic of switching circuits (in case R is a Boolean ring), and classical number theory. We consider computational aspects of the following and related problems:
M. Insall et al., "Conjugating Polynomials on Finite Rings," Symposium on Applied Computing Proceedings, University of Missouri--Rolla, Jan 1994.
The definitive version is available at https://doi.org/10.1145/326619.326746
1994 ACM Symposium on Applied Computing
Mathematics and Statistics
Keywords and Phrases
ring; polynomials; multidimensional arrays
Article - Conference proceedings
© 1994 University of Missouri--Rolla, All rights reserved.
01 Jan 1994