Analysis of Alternative Digit Sets for Nonadjacent Representations

Abstract.It is known that every positive integer n can be represented as a finite sum of the form ∑iai2i, where ai ∈ {0, 1,−1} and no two consecutive ai’s are non-zero (“nonadjacent form”, NAF). Recently, Muir and Stinson [14, 15] investigated other digit sets of the form {0, 1, x}, such that each integer has a nonadjacent representation (such a number x is called admissible). The present paper continues this line of research.The topics covered include transducers that translate the standard binary representation into such a NAF and a careful topological study of the (exceptional) set (which is of fractal nature) of those numbers where no finite look-ahead is sufficient to construct the NAF from left-to-right, counting the number of digits 1 (resp. x) in a (random) representation, and the non-optimality of the representations if x is different from 3 or −1.

[1]  Hsien-Kuei Hwang,et al.  On Convergence Rates in the Central Limit Theorems for Combinatorial Structures , 1998, Eur. J. Comb..

[2]  F. R. Gantmakher.  The Theory of Matrices , 1984 .

[3]  Helmut Prodinger.  ON BINARY REPRESENTATIONS OF INTEGERS WITH DIGITS-1 , 0 , 1 , 2000 .

[4]  Ronald L. Graham,et al.  Concrete mathematics - a foundation for computer science , 1991 .

[5]  W. Neville Holmes,et al.  Binary Arithmetic , 2007, Computer.

[6]  C. Mitchell,et al.  Minimum weight modified signed-digit representations and fast exponentiation , 1989 .

[7]  William J. Cook,et al.  Combinatorial optimization , 1997 .

[8]  Helmut Prodinger,et al.  Distribution results for low-weight binary representations for pairs of integers , 2004, Theor. Comput. Sci..

[9]  Douglas R. Stinson,et al.  Alternative Digit Sets for Nonadjacent Representations , 2005, SIAM J. Discret. Math..

[10]  Clemens Heuberger.  Minimal expansions in redundant number systems: Fibonacci bases and Greedy algorithms , 2004, Period. Math. Hung..

[11]  George W. Reitwiesner,et al.  Binary Arithmetic , 1960, Adv. Comput..

[12]  K. Falconer.  Techniques in fractal geometry , 1997 .

[13]  Helmut Prodinger,et al.  On Minimal Expansions in Redundant Number Systems: Algorithms and Quantitative Analysis , 2001, Computing.

[14]  Helmut Prodinger.  On binary representations of integers with digits . , 2000 .

[15]  G. A. Edgar.  Measure, Topology, and Fractal Geometry , 1990 .

[16]  Peter Lancaster,et al.  The theory of matrices , 1969 .

[17]  William J. Cook,et al.  Combinatorial Optimization: Cook/Combinatorial , 1997 .

[18]  R. A. Brooker,et al.  Advances in Computers. Vol. II , 1962 .

[19]  Thomas Peyrin,et al.  Advances in Alternative Non-adjacent Form Representations , 2004, INDOCRYPT.