The k-error linear complexity distribution for 2n-periodic binary sequences
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 combinatorics, we investigate the k-error linear complexity distribution of 2 n-...
| Main Authors: | , |
|---|---|
| Format: | Journal Article |
| Published: |
Springer
2013
|
| Online Access: | http://hdl.handle.net/20.500.11937/43040 |