The k-error linear complexity distribution for 2n-periodic binary sequences
| dc.contributor.author | Zhou, Jianqin | |
| dc.contributor.author | Liu, Wan-quan | |
| dc.date.accessioned | 2017-01-30T15:04:10Z | |
| dc.date.available | 2017-01-30T15:04:10Z | |
| dc.date.created | 2014-03-04T20:00:37Z | |
| dc.date.issued | 2013 | |
| dc.identifier.citation | Zhou, Jianqin and Liu, Wanquan. 2013. The k-error linear complexity distribution for 2n-periodic binary sequences. Design, Codes and Cryptology. | |
| dc.identifier.uri | http://hdl.handle.net/20.500.11937/43040 | |
| dc.identifier.doi | 10.1007/s10623-013-9805-8 | |
| dc.description.abstract |
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-periodic binary sequences in this paper based on Games–Chan algorithm. First, for k=2,3, the complete counting functions for the k-error linear complexity of 2 n-periodic binary sequences (with linear complexity less than 2n) are characterized. Second, for k=3,4, the complete counting functions for the k-error linear complexity of 2 n-periodic binary sequences with linear complexity 2n are presented. Third, as a consequence of these results, the counting functions for the number of 2 n-periodic binary sequences with the k-error linear complexity for k=2 and 3 are obtained. | |
| dc.publisher | Springer | |
| dc.title | The k-error linear complexity distribution for 2n-periodic binary sequences | |
| dc.type | Journal Article | |
| dcterms.source.issn | 15737586 | |
| dcterms.source.title | Design, Codes and Cryptology | |
| curtin.department | ||
| curtin.accessStatus | Fulltext not available |