The art of computer programming, volume 2 (3rd ed.): seminumerical algorithms
The art of computer programming, volume 2 (3rd ed.): seminumerical algorithms
Cryptography and canonical number systems in quadratic fields
Machine Graphics & Vision International Journal
Digit systems in polynomial rings over finite fields
Finite Fields and Their Applications
| Hi-index | 5.23 |
Let P(x)=pdxd++p0Z[x] be such that d1,pd=1,p02 and N={0,1,...,p01}. We are proving in this note a new criterion for the pair {P(x),N} to be a canonical number system. This enables us to prove that if p2,...,pd1,i=1dpi0 and p02i=1d|pi|, then {P(x),N} is a canonical number system.