Minimal expansions in redundant number systems: Fibonacci bases and greedy algorithms
From MaRDI portal
Publication:2567414
DOI10.1007/s10998-004-0523-xzbMath1072.11007MaRDI 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
11A63: Radix representation; digital problems
11B39: Fibonacci and Lucas numbers and polynomials and generalizations
Related Items
On the number of optimal base 2 representations of integers, On \(\alpha \)-greedy expansions of numbers, Analysis of alternative digit sets for nonadjacent representations, The alternating greedy expansion and applications to computing digit expansions from left-to-right in cryptography, ON THE BINARY DIGITS OF ALGEBRAIC NUMBERS, Minimal weight expansions in Pisot bases
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