Linear complexity, \(k\)-error linear complexity, and the discrete Fourier transform

DOI10.1006/JCOM.2001.0621zbMath1004.68066OpenAlexW2080553743MaRDI QIDQ1599195

Wilfried Meidl, Harald Niederreiter

Publication date: 5 June 2002

Published in: Journal of Complexity (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1006/jcom.2001.0621

zbMATH Keywords

cryptologycomplexity measures

Mathematics Subject Classification ID

Analysis of algorithms (68W40) Shift register sequences and sequences over finite alphabets in information and communication theory (94A55) Cryptography (94A60) Data encryption (aspects in computer science) (68P25) Number-theoretic algorithms; complexity (11Y16) Numerical methods for discrete and fast Fourier transforms (65T50)

Related Items (17)

On the joint 2-adic complexity of binary multisequences ⋮ Remarks on the \(k\)-error linear complexity of \(p^n\)-periodic sequences ⋮ On the \(k\)-error linear complexity for \(p^n\)-periodic binary sequences via hypercube theory ⋮ Error linear complexity measures for multisequences ⋮ Distribution of one-error linear complexity of binary sequences for arbitrary prime period ⋮ The expected value of the joint linear complexity of periodic multisequences ⋮ Extended Games-Chan algorithm for the 2-adic complexity of FCSR-sequences. ⋮ ON THE -ERROR LINEAR COMPLEXITY OF SEQUENCES FROM FUNCTION FIELDS ⋮ Multisequences with large linear and \(k\)-error linear complexity from a tower of Artin-Schreier extensions of function fields ⋮ Some algorithms for the error linear complexity of binary 2 n -periodic sequences ⋮ On the counting function of the lattice profile of periodic sequences ⋮ Generalized Joint Linear Complexity of Linear Recurring Multisequences ⋮ On the \(k\)-error linear complexities of De Bruijn sequences ⋮ Joint linear complexity of multisequences consisting of linear recurring sequences ⋮ How to determine linear complexity and \(k\)-error linear complexity in some classes of linear recurring sequences ⋮ Characterization of \(2^{n}\)-periodic binary sequences with fixed 2-error or 3-error linear complexity ⋮ The expectation and variance of the joint linear complexity of random periodic multisequences

Cites Work

• Linear Complexity and Random Sequences
• An algorithm for the k-error linear complexity of binary sequences with period 2/sup n/
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item

This page was built for publication: Linear complexity, \(k\)-error linear complexity, and the discrete Fourier transform