Exhaustive search methods for CNS polynomials
- First Online:
- Cite this article as:
- Burcsi, P. & Kovács, A. Monatsh Math (2008) 155: 421. doi:10.1007/s00605-008-0005-y
- 44 Downloads
In this paper, we present a method for finding all expansive polynomials with a prescribed degree n and constant term c0. Our research is motivated by the fact that expansivity is a necessary condition for number system constructions. We use the algorithm for an exhaustive search of CNS polynomials for small values of n and c0. We also define semi-CNS polynomials and show that producing them the same search method can be used.