, Volume 155, Issue 3-4, pp 421-430
Date: 13 Aug 2008

Exhaustive search methods for CNS polynomials

Rent the article at a discount

Rent now

* Final gross prices may vary according to local VAT.

Get Access

Abstract

In this paper, we present a method for finding all expansive polynomials with a prescribed degree n and constant term c 0. 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 c 0. We also define semi-CNS polynomials and show that producing them the same search method can be used.

Peter Burcsi was supported by the ELTE-Ericsson Communication Networks Laboratory. The research of Attila Kovács was supported by Bolyai Stipendium, and partly by NKTH RET14/2005 grant under Péter Pázmány program.