A new complexity metric for FH/SS sequences using fuzzy entropy
From MaRDI portal
Recommendations
- Application of the FuzzyEn algorithm to the complexity analysis of chaotic sequences
- Fuzzy permutation entropy derived from a novel distance between segments of time series
- Coding and Cryptography
- Measuring system regularity using fuzzy similarity-based approximate entropy
- The complexity analysis of TD-ERCS discrete chaotic pseudo-random sequences
Cites work
- A fast algorithm for determining the linear complexity of a sequence with period \(p^n\) over GF\((q)\)
- A relationship between linear complexity and k-error linear complexity
- Approximate entropy as a measure of system complexity.
- Computing the error linear complexity spectrum of a binary sequence of period 2/sup n/
- On the Complexity of Finite Sequences
- On the linear and nonlinear complexity profile of nonlinear pseudorandom number generators
- On the linear complexity of nonlinearly filtered pn-sequences
- On the linear complexity profile of the power generator
- Results on the Nonlinear Span of Binary Sequences
Cited in
(3)
This page was built for publication: A new complexity metric for FH/SS sequences using fuzzy entropy
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q350904)