Add to ORKGThis paper deals with pairs of integers, written in base two expansions using digits 0,±1. Representations with minimal Hamming weight (number of non-zero pairs of digits) are of special importance because of applications in Cryptography. The interest here is to count the number of such optimal representations
We consider digit expansions in base q ≥ 2 with arbitrary integer digits such that the length of the...
Güntzer and Paul introduced a number system with base 2 and digits −1, 0, 1 which is characterized b...
Abstract. In a multi-base representation of an integer (in contrast to, for example, the binary or d...
This paper deals with pairs of integers, written in base two expansions using digits 0, ±1. Represen...
summary:Binary signed digit representations (BSDR's) of integers have been studied since the 1950's....
summary:Binary signed digit representations (BSDR's) of integers have been studied since the 1950's....
summary:Binary signed digit representations (BSDR's) of integers have been studied since the 1950's....
AbstractThe central topic of this paper is the alternating greedy expansion of integers, which is de...
Abstract. The central topic of this paper is the alternating greedy expansion of integers, which is ...
AbstractWe discuss an optimal method for the computation of linear combinations of elements of Abeli...
We study representations of integers n in binary expansions using the digits 0, ±1. We analyze the a...
Redundant number systems (e.g., signed binary representations) have been utilized to efficiently imp...
Applications of signed digit representations of an integer include computer arith-metic, cryptograph...
Title: Binary Signed Digit Representations of Integers in Cryptanalysis of Hash Functions Author: Ji...
Abstract. We consider redundant binary joint digital expansions of integer vectors. The redundancy i...
We consider digit expansions in base q ≥ 2 with arbitrary integer digits such that the length of the...
Güntzer and Paul introduced a number system with base 2 and digits −1, 0, 1 which is characterized b...
Abstract. In a multi-base representation of an integer (in contrast to, for example, the binary or d...
This paper deals with pairs of integers, written in base two expansions using digits 0, ±1. Represen...
summary:Binary signed digit representations (BSDR's) of integers have been studied since the 1950's....
summary:Binary signed digit representations (BSDR's) of integers have been studied since the 1950's....
summary:Binary signed digit representations (BSDR's) of integers have been studied since the 1950's....
AbstractThe central topic of this paper is the alternating greedy expansion of integers, which is de...
Abstract. The central topic of this paper is the alternating greedy expansion of integers, which is ...
AbstractWe discuss an optimal method for the computation of linear combinations of elements of Abeli...
We study representations of integers n in binary expansions using the digits 0, ±1. We analyze the a...
Redundant number systems (e.g., signed binary representations) have been utilized to efficiently imp...
Applications of signed digit representations of an integer include computer arith-metic, cryptograph...
Title: Binary Signed Digit Representations of Integers in Cryptanalysis of Hash Functions Author: Ji...
Abstract. We consider redundant binary joint digital expansions of integer vectors. The redundancy i...
We consider digit expansions in base q ≥ 2 with arbitrary integer digits such that the length of the...
Güntzer and Paul introduced a number system with base 2 and digits −1, 0, 1 which is characterized b...
Abstract. In a multi-base representation of an integer (in contrast to, for example, the binary or d...