IEEE Transactions on Computers · 1993 · 127 citations · 6 references
Natural SciencesComputer ScienceMathematicsAlgorithmsCombinatoricsProbability TheoryCombinatorial Number TheoryComputational Number TheoryNumber-theoretic AlgorithmsProbabilistic CombinatoricsRandomized ComputationDiscrete Probability DistributionsHamming DistanceProbabilistic Number-theoretic Algorithms
The authors give an online algorithm for computing a canonical signed digit representation of minimal Hamming weight for any integer n. Using combinatorial techniques, the probability distributions Pr(K/sub r/=h), where K/sub r/ is taken to be a random variable on the uniform probability space of k-digit integers is computed. Also, using a Markov chain analysis, it is shown that E(K/sub r/) approximately (r-1)k/(r+1) as k to infinity .< <ETX xmlns:mml="http://www.w3.org/1998/Math/MathML" xmlns:xlink="http://www.w3.org/1999/xlink">></ETX>
6
The Art of Computer Programming
W.J. Worlton · Nuclear Science and Engineering · 1968 · 2.3K citations
David G. Kendall, A. Rényi · Journal of the Royal Statistical Society Series A (General) · 1971 · 103 citations