Linear Complexities of Periodic Sequences Obtained from Sequences over Z_4 and Z_8 by One-Symbol Substitution
スポンサーリンク
概要
- 論文の詳細を見る
In this paper, we will show that some families of periodic sequences over Z_4 and Z_8 with period multiple of 2^r - 1 generated by r-th degree basic primitive polynomials assorted by the root of each polynomial, and give the exact distribution of sequences for each family. We also point out such an instability as an extreme increase of their linear complexities for the periodic sequences by one-symbol substitution, i.e., from the minimum value to the maximum value, for all the substitutions except one.
- 社団法人電子情報通信学会の論文
- 2003-05-01
著者
-
Uehara Satoshi
Dept. Of Information And Media Sciences The University Of Kitakyushu
-
Uehara Satoshi
Dept. Of Information And Media Engineering The University Of Kitakyushu
-
Imamura K
Kyushu Inst. Technol. Fukuoka Jpn
-
Imamura Kyoki
Dept. Of Computer Science And Electronics Kyushu Institute Of Technology
-
Uehara S
Dept. Of Information And Media Sciences The University Of Kitakyushu
-
MORIUCHI Tsutomu
Department of Information and Electronic Engineering, Yatsushiro National College of Technology
-
MORIUCHI Tsutomu
Dept. of Information and Electronic Engineering, Yatsushiro National College of Technology
-
KAIDA Tkayasu
Dept. of Information and Electronic Engineering, Yatsushiro National College of Technology
-
Kaida Tkayasu
Dept. Of Information And Electronic Engineering Yatsushiro National College Of Technology
-
Moriuchi T
Yatsushiro National Coll. Technol. Kumamoto Jpn
関連論文
- Zero Correlation Distribution of ZCZ Sequences Obtained from a Perfect Sequence and a Unitary Matrix
- Correlation Distribution of a Set of Quaternary Sequences Modified from the Binary Gold Sequences
- On Characteristic Polynomials for Sequences with Maximum Period over Z_
- Linear Complexities of Periodic Sequences Obtained from Sequences over Z_4 and Z_8 by One-Symbol Substitution
- Maximum Order Complexity for the Minimum Changes of an M-Sequence
- Characteristic Polynomials of Binary Complementary Sequences
- Some Properties of Logistic Maps over Integers
- On p-Ary Bent Sequences
- A Derivation of the Phase Difference between n-Tuples of an M-Sequence by Arithmetic over a Finite Field
- Some Conjectures for Matsumoto's Generalization of the Feng-Rao Designed Minimum Distance of Binary Linear Codes
- Rounding Logistic Maps over Integers and the Properties of the Generated Sequences