Minimal expansions in redundant number systems: Fibonacci bases and greedy algorithms
From MaRDI portal
Publication:2567414
DOI10.1007/s10998-004-0523-xzbMath1072.11007OpenAlexW2034555731MaRDI QIDQ2567414
Publication date: 4 October 2005
Published in: Periodica Mathematica Hungarica (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1007/s10998-004-0523-x
Radix representation; digital problems (11A63) Fibonacci and Lucas numbers and polynomials and generalizations (11B39)
Related Items
On \(\alpha \)-greedy expansions of numbers, On the number of optimal base 2 representations of integers, ON THE BINARY DIGITS OF ALGEBRAIC NUMBERS, Analysis of alternative digit sets for nonadjacent representations, Minimal weight expansions in Pisot bases, The alternating greedy expansion and applications to computing digit expansions from left-to-right in cryptography
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Minimal redundant digit expansions in the Gaussian integers
- Carry propagation in signed digit representations
- Optimal left-to-right binary signed-digit recoding
- A Note on Gray Code and Odd-Even Merge
- SUBBLOCK OCCURRENCES IN SIGNED DIGIT REPRESENTATIONS
- Speeding up the computations on an elliptic curve using addition-subtraction chains
- A SIGNED BINARY MULTIPLICATION TECHNIQUE
- On minimal expansions in redundant number systems: Algorithms and quantitative analysis