Generalized Signed-Digit Number Systems: A Unifying Framework for Redundant Number Representations
IEEE Transactions on Computers
Exponentiating faster with addition chains
EUROCRYPT '90 Proceedings of the workshop on the theory and application of cryptographic techniques on Advances in cryptology
Efficient Exponentiation of a Primitive Root in GF(2m)
IEEE Transactions on Computers
A Survey of Combinatorial Gray Codes
SIAM Review
A survey of fast exponentiation methods
Journal of Algorithms
Closed-Form Expression for the Average Weight of Signed-Digit Representations
IEEE Transactions on Computers
Efficient generation of the binary reflected gray code and its applications
Communications of the ACM
Computer Arithmetic: Principles, Architecture and Design
Computer Arithmetic: Principles, Architecture and Design
Signed Digit Representations of Minimal Hamming Weight
IEEE Transactions on Computers
Chord: a scalable peer-to-peer lookup protocol for internet applications
IEEE/ACM Transactions on Networking (TON)
CRYPTO '89 Proceedings of the 9th Annual International Cryptology Conference on Advances in Cryptology
SODA '04 Proceedings of the fifteenth annual ACM-SIAM symposium on Discrete algorithms
Minimal Weight Digit Set Conversions
IEEE Transactions on Computers
Fast exponentiation with precomputation
EUROCRYPT'92 Proceedings of the 11th annual international conference on Theory and application of cryptographic techniques
Gray codes for reflectable languages
Information Processing Letters
| Hi-index | 0.00 |
A string ... a2a1a0 over the alphabet {–1,0,1} is said to be a minimal signed-binary representation of an integer n if n = ∑k≥0ak2k and the number of non-zero digits is minimal. We present a loopless (and hence a Gray code) algorithm for generating all minimal signed binary representations of a given integer n.