On the public citation graph
Closed-form expression for the average weight of signed-digit representations
0 signed · 24 inferred · view as graph
Inferred edges come from two machine sources: sweeps of open repository metadata (mostly SSRN and Zenodo), and a bulk OpenAlex citation snapshot. Every row below is labelled with the one it came from. Neither is a complete citation index — absence here is not evidence of absence.
Is this your work? Sign in with ORCID and put your name on the
claims that are yours.
Reference health. See whether every reference in this work resolves to a
known work and none has been retracted — and get a dated CiteStamped
badge you can embed.
What this work says
Outgoing claims: the papers this work cites, builds on, or argues with.
inferredcites →https://doi.org/10.1007/bf00125080openalex-snapshot
Redundant Integer Representations and Fast Exponentiation
inferredcites →https://doi.org/10.1051/ita/1990240605311openalex-snapshot
Speeding up the computations on an elliptic curve using addition-subtraction chains
inferredcites →https://doi.org/10.1109/12.238495openalex-snapshot
Signed digit representations of minimal Hamming weight
inferredcites →https://doi.org/10.1109/12.565591openalex-snapshot
Efficient exponentiation of a primitive root in GF(2/sup m/)
inferredcites →https://doi.org/10.1109/tec.1961.5219227openalex-snapshot
Signed-Digit Numbe Representations for Fast Parallel Arithmetic
inferredcites →https://doi.org/10.1109/tit.1973.1055100openalex-snapshot
On arithmetic weight for a general radix representation of integers (Corresp.)
inferredcites →https://doi.org/10.2307/2317055openalex-snapshot
The Art of Computer Programming. Volume 2: Seminumerical Algorithms.
What points at this work
Incoming claims: where this work appears in other papers’ reference lists and arguments.
inferred← citeshttps://doi.org/10.1002/cta.70216openalex-snapshot
On the Complexity of Constant Multiplication Problem
inferred← citeshttps://doi.org/10.1007/11561071_40openalex-snapshot
A Loopless Gray Code for Minimal Signed-Binary Representations
inferred← citeshttps://doi.org/10.1007/3-540-45537-x_11openalex-snapshot
An Improved Implementation of Elliptic Curves over GF(2 n) when Using Projective Point Arithmetic
inferred← citeshttps://doi.org/10.1007/s12095-017-0254-5openalex-snapshot
Backtracking-assisted multiplication
inferred← citeshttps://doi.org/10.1017/cbo9780511712180openalex-snapshot
Arithmetic Optimization Techniques for Hardware and Software Design
inferred← citeshttps://doi.org/10.1109/fpt.2007.4439283openalex-snapshot
Multiply Accumulate Unit Optimised for Fast Dot-Product Evaluation
inferred← citeshttps://doi.org/10.1109/iccd.2001.955020openalex-snapshot
Improved ZDN-arithmetic for fast modulo multiplication
inferred← citeshttps://doi.org/10.1109/tcad.2011.2153853openalex-snapshot
An Optimal and Practical Approach to Single Constant Multiplication
inferred← citeshttps://doi.org/10.1145/1240233.1240234openalex-snapshot
Multiplierless multiple constant multiplication
inferred← citeshttps://doi.org/10.11591/eei.v13i2.5437openalex-snapshot
Challenges in data representation for efficient execution of encryption operation
inferred← citeshttps://doi.org/10.14257/ijsia.2013.7.6.27openalex-snapshot
Some Explicit Formulae of NAF and its Left-to-Right Analogue Based on Booth Encoding
inferred← citeshttps://doi.org/10.26021/2754openalex-snapshot
Redundant Number Systems for Optimising Digital Signal Processing Performance in Field Programmable Gate Array
inferred← citeshttps://doi.org/10.70675/990b2e4ez19fcz4589z9730z1849d78815d4openalex-snapshot
Advances in public-key cryptology and computer exploitation
inferred← citeshttps://doi.org/10.70675/a4c4e8d2z5e4cz4eafzbf6bzfb9b77e3cfb7openalex-snapshot
Authentication and encryption protocols : design, attacks and algorithmic improvements
inferred← citeshttps://doi.org/10.71548/12473openalex-snapshot
New Algorithms for Constant Coefficient Multiplication in Custom Hardware
Editorial review for independent work. ICSAC — the Institute for Complexity
Science and Advanced Computing — runs a structured editorial panel for researchers
publishing outside journals, and publishes on CiteStamp rails. Submission is free
and goes through ORCID: icsacinstitute.org/submit.