On the number of optimal base 2 representations of integers
DOI10.1007/s10623-005-6158-yzbMath1261.11003OpenAlexW2091645886MaRDI QIDQ851731
Clemens Heuberger, Peter J. Grabner
Publication date: 22 November 2006
Published in: Designs, Codes and Cryptography (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1007/s10623-005-6158-y
Analysis of algorithms (68W40) Data encryption (aspects in computer science) (68P25) Metric theory of other algorithms and expansions; measure and Hausdorff dimension (11K55) Radix representation; digital problems (11A63) Normal numbers, radix expansions, Pisot numbers, Salem numbers, good lattice points, etc. (11K16) Arithmetic codes (94B40)
Related Items (13)
Cites Work
- Unnamed Item
- Unnamed Item
- Mellin transforms and asymptotics: Digital sums
- Digital sums and divide-and-conquer recurrences: Fourier expansions and absolute convergence
- On the number of odd binomial coefficients
- The state of elliptic curve cryptography
- Analysis of alternative digit sets for nonadjacent representations
- Minimal expansions in redundant number systems: Fibonacci bases and greedy algorithms
- A Survey of Fast Exponentiation Methods
- Functional iterations and stopping times for Brownian motion on the Sierpiński gasket
- On a Family of Symmetric Bernoulli Convolutions
This page was built for publication: On the number of optimal base 2 representations of integers