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

DOI10.1007/S10623-023-01355-WMaRDI QIDQ6544461FDOQ6544461

Authors: Laura Monroe 

Publication date: 27 May 2024

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

zbMATH Keywords

non-adjacent formStern polynomialhyperbinary representationsbinary signed-digit representations

Mathematics Subject Classification ID

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

Cites Work

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

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)