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.
論文 | ランダム
- CS-1170の臨床的研究 (CS-1170(CEFMETAZOLE:CMZ)論文特集)
- 重層型サーマルポジCTPプレートの高機能化
- R/V Maurice Ewing による西部南海トラフ3次元音波探査
- 造血幹細胞移植後患者抹消血より樹立したMHC非依存性T細胞クローンの解析
- 深海曳航測器のマルチセンサ化について(その2) : 深海サイドスキャンソナーの組み込み