Curtin University Homepage
  • Library
  • Help
    • Admin

    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 Theses
    • View Item
    • espace Home
    • espace
    • Curtin Theses
    • View Item

    The k-error Linear Complexity Distribution for Periodic Sequences

    Zhou Jianqin 2017.pdf (1.077Mb)
    Access Status
    Open access
    Authors
    Zhou, Jianqin
    Date
    2017
    Supervisor
    Assoc. Prof. Wanquan Liu
    Type
    Thesis
    Award
    PhD
    
    Metadata
    Show full item record
    Faculty
    Science and Engineering
    School
    Computing
    URI
    http://hdl.handle.net/20.500.11937/54062
    Collection
    • Curtin Theses
    Abstract

    This thesis proposes various novel approaches for studying the k-error linear complexity distribution of periodic binary sequences for k > 2, and the second descent point and beyond of k-error linear complexity critical error points. We present a new tool called Cube Theory. Based on Games-Chan algorithm and the cube theory, a constructive approach is presented to construct periodic sequences with the given k-error linear complexity profile. All examples are verified by computer programs.

    Related items

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

    • 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 ...
    • 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 ...
    • 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, ...
    Advanced search

    Browse

    Communities & CollectionsIssue DateAuthorTitleSubjectDocument TypeThis CollectionIssue DateAuthorTitleSubjectDocument Type

    My Account

    Admin

    Statistics

    Most Popular ItemsStatistics by CountryMost Popular Authors

    Follow Curtin

    • 
    • 
    • 
    • 
    • 

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

    Copyright | Disclaimer | Privacy statement | Accessibility

    Curtin would like to pay respect to the Aboriginal and Torres Strait Islander members of our community by acknowledging the traditional owners of the land on which the Perth campus is located, the Whadjuk people of the Nyungar Nation; and on our Kalgoorlie campus, the Wongutha people of the North-Eastern Goldfields.