论文信息 - Counting optimal joint digit expansions.

Counting optimal joint digit expansions.

This paper deals with pairs of integers, written in base two expansions using digits 0, ±1. Representations with minimal Hamming weight (number of non-zero pairs of digits) are of special importance because of applications in Cryptography. The interest here is to count the number of such optimal representations.

[1] Lauwerens Kuipers,et al. Uniform distribution of sequences , 1974 .

[2] A. Wintner,et al. Distribution functions and the Riemann zeta function , 1935 .

[3] Clemens Heuberger,et al. On the Number of Optimal Base 2 Representations of Integers , 2006, Des. Codes Cryptogr..

[4] J. Solinas. Low-Weight Binary Representations for Pairs of Integers , 2001 .

[5] CLEMENS HEUBERGER,et al. THE ALTERNATING GREEDY EXPANSION AND APPLICATIONS TO LEFT-TO-RIGHT ALGORITHMS IN CRYPTOGRAPHY , 2004 .

[6] Helmut Prodinger,et al. Analysis of linear combination algorithms in cryptography , 2005, TALG.

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

[8] Helmut Prodinger,et al. Analysis of Alternative Digit Sets for Nonadjacent Representations , 2006 .

[9] Frank Harary,et al. Graph Theory , 2016 .

[10] P-4ur,et al. ON A FAMILY OF SYMMETRIC BERNOULLI CONVOLUTIONS , 2002 .

[11] D. R. Heath-Brown. PROBABILISTIC NUMBER THEORY I: MEAN‐VALUE THEOREMS (Grundlehren der mathematischen Wissenschaften 239) , 1981 .

[12] On the Erdős-Turán inequality for balls , 1998 .

[13] Jeffrey J. Holt,et al. The Beurling-Selberg extremal functions for a ball in Euclidean space , 1996 .