On the Linear Complexity of Chung-Yang Sequences over GF(q)
スポンサーリンク
概要
- 論文の詳細を見る
In this letter, we determine the linear complexity and minimum polynomial of the frequency hopping sequences over GF(q) introduced by Chung and Yang, where q is an odd prime. The results of this letter show that these sequences are quite good from the linear complexity viewpoint. By modifying these sequences, another class of frequency hopping sequences are obtained. The modified sequences also have low Hamming autocorrelation and large linear complexity.
- （社）電子情報通信学会の論文
- 2011-07-01
著者
-
Peng Daiyuan
Provincial Key Lab Of Information Coding And Transmission Institute Of Mobile Communications Southwe
-
Liu Fang
Provincial Key Lab Of Information Coding And Transmission Inst. Of Mobile Communications Southwest J
-
Liu Fang
Provincial Key Lab Of Information Coding And Transmission Institute Of Mobile Communications Southwe
-
Peng Daiyuan
Provincial Key Lab Of Information Coding And Transmission Inst. Of Mobile Communications Southwest J
-
Peng Daiyuan
Provincial Key Lab Of Information Coding And Transmission Institute Of Mobile Communications Southwe
関連論文
- Lower Bounds on the Aperiodic Hamming Correlations of Frequency Hopping Sequences with Low Hit Zone
- New p-Ary Sequences with Low Correlation and Large Family Size
- Lower Bounds on the Maximum Partial Correlations of Frequency Hopping Sequence Set with Low Hit Zone
- A New Set of Optimal Frequency-Hopping Sequences
- Performance of a Novel MFSK/FHMA System Employing No-Hit Zone Sequence Set over Rayleigh Fading Channel
- On the Linear Complexity of Chung-Yang Sequences over GF(q)
- Lower Bounds on the Aperiodic Hamming Correlations of Frequency Hopping Sequences
- New Classes of Optimal Low Hit Zone Frequency Hopping Sequences with New Parameters by Interleaving Technique