Linear complexity, \(k\)-error linear complexity, and the discrete Fourier transform
From MaRDI portal
Publication:1599195
DOI10.1006/jcom.2001.0621zbMath1004.68066MaRDI 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
68W40: Analysis of algorithms
94A55: Shift register sequences and sequences over finite alphabets in information and communication theory
94A60: Cryptography
68P25: Data encryption (aspects in computer science)
11Y16: Number-theoretic algorithms; complexity
65T50: Numerical methods for discrete and fast Fourier transforms
Related Items
ON THE -ERROR LINEAR COMPLEXITY OF SEQUENCES FROM FUNCTION FIELDS, Some algorithms for the error linear complexity of binary 2 n -periodic sequences, Distribution of one-error linear complexity of binary sequences for arbitrary prime period, Multisequences with large linear and \(k\)-error linear complexity from a tower of Artin-Schreier extensions of function fields, Error linear complexity measures for multisequences, 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 expected value of the joint linear complexity of periodic multisequences, Extended Games-Chan algorithm for the 2-adic complexity of FCSR-sequences., On the \(k\)-error linear complexities of De Bruijn sequences, Remarks on the \(k\)-error linear complexity of \(p^n\)-periodic sequences, On the counting function of the lattice profile of periodic sequences, The expectation and variance of the joint linear complexity of random periodic multisequences, On the \(k\)-error linear complexity for \(p^n\)-periodic binary sequences via hypercube theory, On the joint 2-adic complexity of binary multisequences, Generalized Joint Linear Complexity of Linear Recurring Multisequences
Cites Work
