Linear complexity of generalized cyclotomic sequences with period $2^mp^n$
Prikladnaya Diskretnaya Matematika. Supplement, no. 5 (2012), pp. 8-9
Citer cet article
Voir la notice de l'article provenant de la source Math-Net.Ru
A method for analyzing the linear complexity of generalized cyclotomic sequences with period $2^mp^n$ is proposed. It allows to pick out sequences with the high linear complexity. The linear complexity of some sequences is computed on the base of classes of quadratic and biquadratic residues.
[1] Edemskii V. A., “O lineinoi slozhnosti dvoichnykh posledovatelnostei na osnove klassov bikvadratichnykh i shesterichnykh vychetov”, Diskretnaya matematika, 22:1 (2010), 74–82 | MR | Zbl
[2] Edemskiy V. A., “About computation of the linear complexity of generalized cyclotomic sequences with period $p^{n+1}$”, Designs, Codes and Cryptography, 61:3 (2011), 251–260 | DOI | MR | Zbl
[3] Edemskii V. A., Antonova O. V., “Lineinaya slozhnost obobschënnykh tsiklotomicheskikh posledovatelnostei s periodom $2^mp^n$”, Prikladnaya diskretnaya matematika, 2012, no. 3, 5–12