On the balancedness of nonlinear generators of binary sequences
✍ Scribed by Amparo Fúster-Sabater; Pedro Garcı́a-Mochales
- Publisher
- Elsevier Science
- Year
- 2003
- Tongue
- English
- Weight
- 87 KB
- Volume
- 85
- Category
- Article
- ISSN
- 0020-0190
No coin nor oath required. For personal study only.
✦ Synopsis
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.
📜 SIMILAR VOLUMES
We propose the general framework of a new algorithm, derived from the interactions of chains of RNA, which is capable of self-organization. It considers sequences of binary numbers (strings) and their interaction with each other. Analogous to RNA systems, a folding of sequences is introduced to gene