ISSN:
1436-5057
Keywords:
AMS Subject Classifications:11A63, 05C12, 68R10.
;
Key words.Radix expansion, redundant number systems, shortest paths in graphs.
Source:
Springer Online Journal Archives 1860-2000
Topics:
Computer Science
Notes:
Abstract. We consider digit expansions $n=\sum_{i=0}^l \epsilon_iq^i$ in redundant number systems to base q with $-(q-1)\le \epsilon_i\le q-1$ and consider such an expansion as minimal, if $l+\sum_{i=0}^l \betrag{\epsilon_i}$ is minimal. We describe an efficient algorithm for determining a minimal representation and give an explicit characterization of optimal representations for odd q.
Type of Medium:
Electronic Resource
URL:
http://dx.doi.org/10.1007/s006070050039
Permalink