Linear complexity of periodic sequences: a general theory
From MaRDI portal
Recommendations
- scientific article; zbMATH DE number 1047548
- On evaluating the linear complexity of a sequence of least period \(2^ n\)
- Computing the linear complexity for sequences with characteristic polynomial f^v
- Information Security and Cryptology
- Fast Algorithms for Determining the Linear Complexity of Sequences Over<tex>$hboxGF,(p^m)$</tex>With Period<tex>$2^tn$</tex>
Cites work
- A fast algorithm for determining the complexity of a binary sequence with period<tex>2^n</tex>(Corresp.)
- A generalisation of the discrete Fourier transform: determining the minimal polynomial of a periodic sequence
- Algebraic coding theory
- An analysis of the structure and complexity of nonlinear binary sequence generators
- Analysis and design of stream ciphers
- Differentialrechnung bei Charakteristik p.
- scientific article; zbMATH DE number 3882549 (Why is no real title available?)
- scientific article; zbMATH DE number 691469 (Why is no real title available?)
- scientific article; zbMATH DE number 1406791 (Why is no real title available?)
- On evaluating the linear complexity of a sequence of least period \(2^ n\)
- On repeated-root cyclic codes
- Theorie der höheren Differentiale in einem algebraischen Funktionenkörper mit vollkommenem Konstantenkörper bei beliebiger Charakteristik.
Cited in
(24)- Composition of recursions and nonlinear complexity of periodic binary sequences
- Joint linear complexity of multisequences consisting of linear recurring sequences
- Factorization of determinants over finite fields and application in stream ciphers
- The expected value of the joint linear complexity of periodic multisequences
- Computing the linear complexity for sequences with characteristic polynomial f^v
- On the algebraic structure of quasi-cyclic codes. IV: Repeated roots
- The expectation and variance of the joint linear complexity of random periodic multisequences
- Asymptotic Behavior of Normalized Linear Complexity of Ultimately Nonperiodic Binary Sequences
- A general approach to construction and determination of the linear complexity of sequences based on cosets
- scientific article; zbMATH DE number 4062996 (Why is no real title available?)
- scientific article; zbMATH DE number 25605 (Why is no real title available?)
- Linear Complexity of Periodically Repeated Random Sequences
- scientific article; zbMATH DE number 1335885 (Why is no real title available?)
- A generalisation of the discrete Fourier transform: determining the minimal polynomial of a periodic sequence
- scientific article; zbMATH DE number 1047548 (Why is no real title available?)
- Fourier transforms and the 2-adic span of periodic binary sequences
- Linear complexity of a sequence obtained from a periodic sequence by either substituting, inserting, or deleting k symbols within one period
- Two-dimensional generalized discrete Fourier transform and related quasi-cyclic Reed-Solomon codes
- On the k-Operation Linear Complexity of Periodic Sequences
- A family of keystream generators with large linear complexity
- On the structure of repeated-root polycyclic codes over local rings
- A generalization of the pascal matrix and an application to coding theory
- The linear complexity of binary sequences of length 2p with optimal three-level autocorrelation
- Revisiting the relationship between compositional sequence complexity and periodicity
This page was built for publication: Linear complexity of periodic sequences: a general theory
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q3452366)
