The k-error Linear Complexity Distribution for Periodic Sequences
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 a...
| Main Author: | |
|---|---|
| Format: | Thesis |
| Published: |
Curtin University
2017
|
| Online Access: | http://hdl.handle.net/20.500.11937/54062 |
| _version_ | 1848759295801294848 |
|---|---|
| author | Zhou, Jianqin |
| author_facet | Zhou, Jianqin |
| author_sort | Zhou, Jianqin |
| building | Curtin Institutional Repository |
| collection | Online Access |
| description | 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. |
| first_indexed | 2025-11-14T09:57:37Z |
| format | Thesis |
| id | curtin-20.500.11937-54062 |
| institution | Curtin University Malaysia |
| institution_category | Local University |
| last_indexed | 2025-11-14T09:57:37Z |
| publishDate | 2017 |
| publisher | Curtin University |
| recordtype | eprints |
| repository_type | Digital Repository |
| spelling | curtin-20.500.11937-540622017-07-04T04:17:06Z The k-error Linear Complexity Distribution for Periodic Sequences Zhou, Jianqin 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. 2017 Thesis http://hdl.handle.net/20.500.11937/54062 Curtin University fulltext |
| spellingShingle | Zhou, Jianqin The k-error Linear Complexity Distribution for Periodic Sequences |
| title | The k-error Linear Complexity Distribution for Periodic Sequences |
| title_full | The k-error Linear Complexity Distribution for Periodic Sequences |
| title_fullStr | The k-error Linear Complexity Distribution for Periodic Sequences |
| title_full_unstemmed | The k-error Linear Complexity Distribution for Periodic Sequences |
| title_short | The k-error Linear Complexity Distribution for Periodic Sequences |
| title_sort | k-error linear complexity distribution for periodic sequences |
| url | http://hdl.handle.net/20.500.11937/54062 |