A. Fúster-Sabater, P. García-Mochales
Information Processing Letters. vol. 85, no. 2, pp. 111-116
A simple method of computing the number of 1's in the binary sequences obtained from combination generators has been developed. The procedure, which is based exclusively on the particular form of the combining function, can be applied to standard generators proposed and published in the open literature. As a straight consequence of this method, simple rules to design generators producing balanced (quasi-balanced) sequences are also derived.
