Curtin University Homepage
  • Library
  • FAQ
    • Log in

    espace - Curtin’s institutional repository

    JavaScript is disabled for your browser. Some features of this site may not work without it.
    View Item 
    • espace Home
    • espace
    • Curtin Research Publications
    • View Item
    • espace Home
    • espace
    • Curtin Research Publications
    • View Item

    On the Second Descent Points for the K-Error Linear Complexity of 2(n)-Periodic Binary Sequences

    Access Status
    Fulltext not available
    Authors
    Zhou, J.
    Wang, X.
    Liu, Wan-Quan
    Date
    2016
    Collection
    • Curtin Research Publications
    Type
    Conference Paper
    Metadata
    Show full item record
    Abstract

    In this paper, a constructive approach for determining CELCS (critical error linear complexity spectrum) for the kerror linear complexity distribution of 2n -periodic binary sequences is developed via the sieve method and Games-Chan algorithm. Accordingly, the second descent point (critical point) distribution of the k-error linear complexity for 2n -periodic binary sequences is characterized. As a by product, it is proved that the maximum k-error linear complexity is 2n -(2l -1) over all 2n -periodic binary sequences, where 2l-1<=k < 2l and l < n. With these results, some work by Niu et al. are proved to be incorrect.

    Citation
    Zhou, J. and Wang, X. and Liu, W. 2016. On the Second Descent Points for the K-Error Linear Complexity of 2(n)-Periodic Binary Sequences, International Conference on Communications, Information Management and Network Security (CIMNS), pp. 311-314.
    Source Title
    PROCEEDINGS OF THE 2016 INTERNATIONAL CONFERENCE ON COMMUNICATIONS, INFORMATION MANAGEMENT AND NETWORK SECURITY
    URI
    http://hdl.handle.net/20.500.11937/63463
    Department
    Department of Computing

    Related items

    Showing items related by title, author, creator and subject.

    • Cube theory and k-error linear complexity profile
      Zhou, J.; Liu, Wan-Quan; Wang, X. (2016)
      © 2016 SERSC. The linear complexity and k-error linear complexity of a sequence have been used as important measures for keystream strength. In order to study k-error linear complexity of binary sequences with period 2n, ...
    • The k-error linear complexity distribution for 2n-periodic binary sequences
      Zhou, Jianqin; Liu, Wan-quan (2013)
      The linear complexity and the k-error linear complexity of a sequence have been used as important security measures for key stream sequence strength in linear feedback shift register design. By using the sieve method of ...
    • Complete characterization of the first descent point distribution for the k-error linear complexity of 2n-periodic binary sequences
      Zhou, J.; Liu, Wan-Quan; Wang, X. (2017)
      In this paper, a new constructive approach of determining the first descent point distribution for the k-error linear complexity of 2 n -periodic binary sequences is developed using the sieve method and Games-Chan ...
    Advanced search

    Browse

    Communities & CollectionsIssue DateAuthorsTitlesSubjectsDocument TypesThis CollectionIssue DateAuthorsTitlesSubjectsDocument Types

    My Account

    Log in

    Statistics

    Most Popular ItemsStatistics by CountryMost Popular Authors

    Connect with Curtin

    • 
    • 
    • 
    • 
    • 
    • 
    • 

    CRICOS Provider Code: 00301JABN: 99 143 842 569TEQSA: PRV12158

    Send FeedbackContact Us
    DSpace software copyright © 2002-2015  DuraSpace