Bibliographic Details
| Title: |
Some Enumeration Results on Binary 2n-Periodic Sequences. |
| Authors: |
Chang, Zuling1,2, Ke, Pinhui2, Zhao, Yongcheng1 |
| Source: |
International Journal of Foundations of Computer Science. Feb2017, Vol. 28 Issue 2, p171-184. 14p. |
| Subjects: |
Binary sequences, Critical point theory, Algorithms, Linear systems, Computational complexity |
| Abstract: |
This paper studies some enumeration problems of binary sequences with period 2 n based on the Games-Chan algorithm and a modified Stamp-Martin algorithm. We provide the exact number of critical error sequences of binary 2 n-periodic sequences corresponding to the second critical point. The exact formula for the number of binary 2 n-periodic sequences with exactly three critical points is also derived. [ABSTRACT FROM AUTHOR] |
|
Copyright of International Journal of Foundations of Computer Science is the property of World Scientific Publishing Company and its content may not be copied or emailed to multiple sites without the copyright holder's express written permission. Additionally, content may not be used with any artificial intelligence tools or machine learning technologies. However, users may print, download, or email articles for individual use. This abstract may be abridged. No warranty is given about the accuracy of the copy. Users should refer to the original published version of the material for the full abstract. (Copyright applies to all Abstracts.) |
| Database: |
Engineering Source |
