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 |