Meidl, Wilfried and Venkateswarlu, Ayineedi (2007) Remarks on the k-error linear complexity of p(n)-periodic sequences. Designs, Codes, and Cryptography, 42 (2). pp. 181-193. ISSN 0925-1022 (Print) 1573-7586 (Online)
![[thumbnail of This is a RoMEO green publisher -- author can archive pre-print (ie pre-refereeing) and post-print (ie final draft post-refereeing)]](https://research.sabanciuniv.edu/style/images/fileicons/application_pdf.png)
PDF (This is a RoMEO green publisher -- author can archive pre-print (ie pre-refereeing) and post-print (ie final draft post-refereeing))
3011800000282.pdf
Download (167kB)
Official URL: http://dx.doi.org/10.1007/s10623-006-9029-2
Abstract
Recently the first author presented exact formulas for the number of 2ⁿn-periodic binary sequences with given 1-error linear complexity, and an exact formula for the expected 1-error linear complexity and upper and lower bounds for the expected k-error linear complexity, k >2, of a random 2ⁿn-periodic binary sequence. A crucial role for the analysis played the Chan-Games algorithm. We use a more sophisticated generalization of the Chan-Games algorithm by Ding et al. to obtain exact formulas for the counting function and the expected value for the 1-error linear complexity for pⁿn-periodic sequences over Fp, p prime. Additionally we discuss the calculation of lower and upper bounds on the k-error linear complexity of pⁿn-periodic sequences over Fp.
| Item Type: | Article |
|---|---|
| Uncontrolled Keywords: | linear complexity; k-error linear complexity; Chan-Games algorithm; periodic sequences; stream cipher |
| Subjects: | Q Science > QA Mathematics |
| Divisions: | Faculty of Engineering and Natural Sciences |
| Depositing User: | Wilfried Meidl |
| Date Deposited: | 17 Nov 2006 02:00 |
| Last Modified: | 04 Sep 2019 09:39 |
| URI: | https://research.sabanciuniv.edu/id/eprint/44 |
Actions (login required)
- View Item