2021/08/31 by Laura Monroe
Computer Science · Mathematics · #Benford’s Law and Fraud Detection #Coding theory and cryptography #math.CO #math.NT #msc:11A63 #msc:11B83 #msc:68R01 #semigroups and automata theory
paper · pdf · doi:10.1007/s10623-021-00903-6
published as Des. Codes Cryptogr. 89 (2021) 1-10 · 13 pages, 0 figures. Portions of this previously appeared as arXiv:2103.05810 which was split for publication. To appear in Designs, Codes and Cryptography
openalex created_date 2021/08/30 · openalex publication_date 2021/10/05 · arxiv created 2021/10/06 · arxiv updated 2021/10/07 · openalex updated_date 2026/07/29
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<2i is the (2i-n)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.