The k-error Linear Complexity Distribution for Periodic Sequences
| dc.contributor.author | Zhou, Jianqin | |
| dc.contributor.supervisor | Assoc. Prof. Wanquan Liu | en_US |
| dc.date.accessioned | 2017-07-04T04:17:06Z | |
| dc.date.available | 2017-07-04T04:17:06Z | |
| dc.date.issued | 2017 | |
| dc.identifier.uri | http://hdl.handle.net/20.500.11937/54062 | |
| dc.description.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. | en_US |
| dc.publisher | Curtin University | en_US |
| dc.title | The k-error Linear Complexity Distribution for Periodic Sequences | en_US |
| dc.type | Thesis | en_US |
| dcterms.educationLevel | PhD | en_US |
| curtin.department | Computing | en_US |
| curtin.accessStatus | Open access | en_US |
| curtin.faculty | Science and Engineering | en_US |