您当前的位置：
首页 >
文章列表页 >
Linear complexity of two classes of optimal sets frequency-hopping sequences
Academic communication | 更新时间：2024-06-05

    • Linear complexity of two classes of optimal sets frequency-hopping sequences

    • Journal on Communications   Vol. 33, Issue 2, Pages: 175-181(2012)

    • DOI：1000-436X(2012)02-0175-07    

      CLC： TN918.1

    • Online First：2012-02，

      Published：25 February 2012

    移动端阅览

  • Jun-tao GAO, Yu-pu HU, Xue-lian LI, et al. Linear complexity of two classes of optimal sets frequency-hopping sequences[J]. Journal on Communications, 2012, 33(2): 175-181. DOI： 1000-436X(2012)02-0175-07.

  •  
  •  

0

Views

560

下载量

1

CSCD

Alert me when the article has been cited
提交
Tools
Download
Export Citation
Share
Add to favorites
Add to my album

Related Articles

Construction method and performance analysis of chaotic frequency-hopping sequences based on Logistic-Sine-Cosine mapping
On the linear complexity of a new generalized cyclotomic sequence with length mover GF(h)
New class of frequency-hopping sequences set with optimal average Hamming correlation property
Number of sequences with given linear complexity profiles
On the third depth distribution and the period of sequence {（E-1）～m（s）}m≥0 over F2

Related Author

SUN Jingzhang
DAI Junhao
SHI Jingcheng
YANG Haoning
TAO Hongfei
SUN Yang
WANG Yinglin
CAO Chunjie

Related Institution

School of Cyberspace Security (School of Cryptology), Hainan University
Key Laboratory of Network ＆Information Security of Armed Police Force,Engineering University of Armed Police Force
Key Laboratory of Computer Network ＆Information Security of the Ministry of Education,Xidian University
Key Laboratory of Network Security and Cryptology,Fujian Normal University
Department of Applied Mathematics, Zhengzhou Information Engineering University
0