Analysis of the Berlekamp-Massey Linear Feedback Shift-Register Synthesis Algorithm
From MaRDI portal
Publication:4121824
Cited in
(19)- Joint linear complexity of multisequences consisting of linear recurring sequences
- A Newton's algorithm for solving multicountry econometric models
- ADI on staggered mesh. A method for the calculation of compressible convection
- Counting functions and expected values for the \(k\)-error linear complexity
- Linear recurring sequences over modules
- Linear recurring sequences over rings and modules
- Efficient parallel factorization and solution of structured and unstructured linear systems
- Counting functions and expected values for the lattice profile at \(n\)
- On sequences, rational functions and decomposition
- Research problems
- Solving linear systems in interior-point methods
- On the spectral immunity of periodic sequences restricted to binary annihilators
- On Linear Complexity of Finite Sequences: Coding Theory and Applications to Cryptography
- Asymptotic analysis on the normalized k-error linear complexity of binary sequences
- Some notes on the pseudorandomness of Legendre symbol and Liouville function
- A mathematical model and numerical method for studying platelet adhesion and aggregation during blood clotting
- The asymptotic behavior of the joint linear complexity profile of multisequences
- A combinatorial approach to probabilistic results on the linear- complexity profile of random sequences
- Enumeration results on the joint linear complexity of multisequences
This page was built for publication: Analysis of the Berlekamp-Massey Linear Feedback Shift-Register Synthesis Algorithm
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q4121824)
