Efficient generation of the binary reflected gray code and its applications
โ Scribed by Bitner, James R.; Ehrlich, Gideon; Reingold, Edward M.
- Book ID
- 118124593
- Publisher
- Association for Computing Machinery
- Year
- 1976
- Tongue
- English
- Weight
- 470 KB
- Volume
- 19
- Category
- Article
- ISSN
- 0001-0782
No coin nor oath required. For personal study only.
๐ SIMILAR VOLUMES
It is shown that for 1 <~j<~n and 1 ~<k ~<2", the jth letter of the kth word of the binary reflected Gray code of length n is equal to the parity of the binomial coefficient 2"-2" ~ iC[2, 2,-~-~-~/21 modulo 2. Also it is shown how this observation and the usual iterative definition of the binary ref
## Abstract According to the three classifications of nucleotides, we introduce a sort of binary coding method of RNA secondary structures. On the basis of this representation, we can reduce a RNA secondary structure into three binary digit sequences. We also propose coding rules based on the exclu