On arithmetic weight for a general radix representation of integers (Corresp.)

In this correspondence we define a "nonadjacent form" for integers in an arbitrary radix
r > 1
. This form is proved to be unique, and the arithmetic weight of an integer is shown to be equal to the number of nonzero terms in the form. Two algorithms are presented for the computation of this form. If
r = 2
, our form coincides with the well-known modified binary nonadjacent form.