Abstract
A method for speeding up integer exponentiation by using a modified signed-digit (MSD) representation of the exponent is described. The method works best when the weight of the representation is minimised. An algorithm for finding a minimum weight MSD representation is presented.
Keywords
Affiliated Institutions
Related Publications
Some baby-step giant-step algorithms for the low hamming weight discrete logarithm problem
In this paper, we present several baby-step giant-step algorithms for the low hamming weight discrete logarithm problem. In this version of the discrete log problem, we are requ...
On the minimum distance of some quadratic residue codes (Corresp.)
We find the minimum distances of the binary <tex xmlns:mml="http://www.w3.org/1998/Math/MathML" xmlns:xlink="http://www.w3.org/1999/xlink">(113, 57)</tex> , and ternary <tex xml...
Design of balanced and constant weight codes for VLSI systems
A constant weight, w, code with k information bits and r check bits is a binary code of length n=k+r and cardinality 2/sup k/ such that the number of 1s in each code word is equ...
Using Linear Programming to Decode Binary Linear Codes
A new method is given for performing approximate maximum-likelihood (ML) decoding of an arbitrary binary linear code based on observations received from any discrete memoryless ...
Publication Info
- Year
- 1989
- Type
- article
- Volume
- 25
- Issue
- 17
- Pages
- 1171-1172
- Citations
- 85
- Access
- Closed
External Links
Social Impact
Social media, news, blog, policy document mentions
Citation Metrics
Cite This
Identifiers
- DOI
- 10.1049/el:19890785