Binary Signed-Digit Integers and the Stern Diatomic Sequence
Author:
Preprint
Abstract
Stern's diatomic sequence is a well-studied and simply defined sequence with many fascinating characteristics. The binary signed-digit representation of integers is an alternative representation of integers with much use in efficient computation, coding theory and cryptography. We link these two ideas here, showing that the number of $i$-bit binary signed-digit representations of an integer $n$ with $n<2^i$ is the $(2^i-n)^\text{th}$ element in Stern's diatomic sequence. This correspondence makes the vast range of results known for Stern's diatomic sequence available for consideration in the study of binary signed-digit integers.
Keywords
All Related Versions
This publication has 14 references indexed in Scilit:
- Oeuvres complètes2009
- On binary signed digit representations of integersDesigns, Codes and Cryptography, 2006
- On the Number of Optimal Base 2 Representations of IntegersDesigns, Codes and Cryptography, 2006
- CM-Curves with Good Cryptographic Properties2001
- Speeding up the computations on an elliptic curve using addition-subtraction chainsRAIRO - Theoretical Informatics and Applications, 1990
- Some Binary Partition Functions1990
- Selected Writings on Computing: A personal Perspective1982
- A problem in partitions related to the Stirling numbersBulletin of the American Mathematical Society, 1964
- A SIGNED BINARY MULTIPLICATION TECHNIQUEQuarterly Journal of Mechanics and Applied Mathematics, 1951
- I. A short account of negativo-affirmative arithmetick, by Mr. John Colson, F. R. S.Philosophical Transactions of the Royal Society of London, 1726