A new complexity metric for FH/SS sequences using fuzzy entropy

DOI10.1007/s11432-011-4203-1zbMath1267.94002MaRDI QIDQ350904

Jiangbo Si, Baoming Bai, Zan Li, Jueping Cai, Xiaojun Chen

Publication date: 3 July 2013

Published in: Science China. Information Sciences (Search for Journal in Brave)

Full work available at URL: http://engine.scichina.com/doi/10.1007/s11432-011-4203-1

zbMATH Keywords

complexity metric; frequency-hopping sequence; fuzzy entropy

Mathematics Subject Classification ID

94A17: Measures of information, entropy

94D05: Fuzzy sets and logic (in connection with information, communication, or circuits theory)

94A05: Communication theory

Related Items

Generation and characterization of orthogonal FH sequences for the cognitive network

Cites Work

• On the linear complexity profile of the power generator
• A fast algorithm for determining the linear complexity of a sequence with period p/sup n/ over GF(q)
• On the linear complexity of nonlinearly filtered pn-sequences
• Results on the Nonlinear Span of Binary Sequences
• Approximate entropy as a measure of system complexity.
• On the Complexity of Finite Sequences
• A relationship between linear complexity and k-error linear complexity
• On the linear and nonlinear complexity profile of nonlinear pseudorandom number generators
• Computing the error linear complexity spectrum of a binary sequence of period 2/sup n/