View in EDS

Some Enumeration Results on Binary 2n-Periodic Sequences.

Saved in:
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
FullText Text:
  Availability: 0
Header DbId: egs
DbLabel: Engineering Source
An: 122271909
AccessLevel: 6
PubType: Academic Journal
PubTypeId: academicJournal
PreciseRelevancyScore: 0
IllustrationInfo
Items – Name: Title
  Label: Title
  Group: Ti
  Data: Some Enumeration Results on Binary 2<superscript>n</superscript>-Periodic Sequences.
– Name: Author
  Label: Authors
  Group: Au
  Data: <searchLink fieldCode="AR" term="%22Chang%2C+Zuling%22">Chang, Zuling</searchLink><relatesTo>1,2</relatesTo><br /><searchLink fieldCode="AR" term="%22Ke%2C+Pinhui%22">Ke, Pinhui</searchLink><relatesTo>2</relatesTo><br /><searchLink fieldCode="AR" term="%22Zhao%2C+Yongcheng%22">Zhao, Yongcheng</searchLink><relatesTo>1</relatesTo>
– Name: TitleSource
  Label: Source
  Group: Src
  Data: <searchLink fieldCode="JN" term="%22International+Journal+of+Foundations+of+Computer+Science%22">International Journal of Foundations of Computer Science</searchLink>. Feb2017, Vol. 28 Issue 2, p171-184. 14p.
– Name: Subject
  Label: Subjects
  Group: Su
  Data: <searchLink fieldCode="DE" term="%22Binary+sequences%22">Binary sequences</searchLink><br /><searchLink fieldCode="DE" term="%22Critical+point+theory%22">Critical point theory</searchLink><br /><searchLink fieldCode="DE" term="%22Algorithms%22">Algorithms</searchLink><br /><searchLink fieldCode="DE" term="%22Linear+systems%22">Linear systems</searchLink><br /><searchLink fieldCode="DE" term="%22Computational+complexity%22">Computational complexity</searchLink>
– Name: Abstract
  Label: Abstract
  Group: Ab
  Data: 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]
– Name: AbstractSuppliedCopyright
  Label:
  Group: Ab
  Data: <i>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.</i> (Copyright applies to all Abstracts.)
PLink https://search.ebscohost.com/login.aspx?direct=true&site=eds-live&db=egs&AN=122271909
RecordInfo BibRecord:
  BibEntity:
    Identifiers:
      – Type: doi
        Value: 10.1142/S0129054117500113
    Languages:
      – Code: eng
        Text: English
    PhysicalDescription:
      Pagination:
        PageCount: 14
        StartPage: 171
    Subjects:
      – SubjectFull: Binary sequences
        Type: general
      – SubjectFull: Critical point theory
        Type: general
      – SubjectFull: Algorithms
        Type: general
      – SubjectFull: Linear systems
        Type: general
      – SubjectFull: Computational complexity
        Type: general
    Titles:
      – TitleFull: Some Enumeration Results on Binary 2n-Periodic Sequences.
        Type: main
  BibRelationships:
    HasContributorRelationships:
      – PersonEntity:
          Name:
            NameFull: Chang, Zuling
      – PersonEntity:
          Name:
            NameFull: Ke, Pinhui
      – PersonEntity:
          Name:
            NameFull: Zhao, Yongcheng
    IsPartOfRelationships:
      – BibEntity:
          Dates:
            – D: 01
              M: 02
              Text: Feb2017
              Type: published
              Y: 2017
          Identifiers:
            – Type: issn-print
              Value: 01290541
          Numbering:
            – Type: volume
              Value: 28
            – Type: issue
              Value: 2
          Titles:
            – TitleFull: International Journal of Foundations of Computer Science
              Type: main
ResultId 1