Optimal binary signed-digit representations of integers and the Stern polynomial

DOI10.1007/S10623-023-01355-WMaRDI QIDQ6544461zbMATH OpenFDO

Authors Laura Monroe

Publication date 27 May 2024

Published in Designs, Codes and Cryptography (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1007/S10623-023-01355-W

zbMATH Keywords

binary signed-digit representationshyperbinary representationsnon-adjacent formStern polynomial

Mathematics Subject Classification ID

Radix representation; digital problems (11A63) Special sequences and polynomials (11B83) General topics of discrete mathematics in relation to computer science (68R01)

Recommendations

• Binary signed-digit integers and the Stern diatomic sequence
• On optimal binary signed digit representations of integers
• On binary signed digit representations of integers
• Non-standard binary representations and the Stern sequence
• On the number of binary signed digit representations of a given weight.

Cites work

• A SIGNED BINARY MULTIPLICATION TECHNIQUE
• A Simple Gray Code to List All Minimal Signed Binary Representations
• A Symmetrical Notation for Numbers
• Arithmetic properties of the sequence of degrees of Stern polynomials and related results
• Binary signed-digit integers and the Stern diatomic sequence
• scientific article; zbMATH DE number 176613 (Why is no real title available?)
• scientific article; zbMATH DE number 4187932 (Why is no real title available?)
• On certain arithmetic properties of Stern polynomials
• On the factors of Stern polynomials (remarks on the preceding paper of M. Ulas)
• On the number of binary signed digit representations of a given weight.
• On the number of optimal base 2 representations of integers
• Speeding up the computations on an elliptic curve using addition-subtraction chains
• Square classes and divisibility properties of Stern polynomials
• Stern polynomials
• The Leading Coefficients of Stern Polynomials

Cited in

(2)

• Non-standard binary representations and the Stern sequence
• Isomorphisms of graphs of hyperbinary expansions and efficient algorithms for Stern's diatomic sequence

This page was built for publication: Optimal binary signed-digit representations of integers and the Stern polynomial

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q6544461)