Maximum Order Complexity for the Minimum Changes of an M-Sequence
スポンサーリンク
概要
- 論文の詳細を見る
The maximum order complexity (MOC) of a sequence is a very natural generalization of the well-known linear complexity (LC) by allowing nonlinear feedback functions for the feedback shift register which generates a given sequence. It is expected that MOC is effective to reduce such an instability of LC as an extreme increase caused by the minimum changes of a periodic sequence, i. e., one-symbol substitution, one-symbol insertion or one-symbol deletion per each period. In this paper we well give the bounds (lower and upper bounds) of MOC for the minimum changes of an m-sequence over GF (q) with period q^n-1, which shows that MOC is much more natural than LC as a measure for the randomness of sequences in this case.
- 社団法人電子情報通信学会の論文
- 1998-11-25
著者
-
Uehara Satoshi
Dept. Of Information And Media Sciences The University Of Kitakyushu
-
Uehara Satoshi
The Faculty Of Computer Science And Systems Engineering Kyushu Institute Of Technology
-
Imamura K
Kyushu Inst. Technol. Fukuoka Jpn
-
Imamura Kyoki
The Faculty Of Computer Science And Systems Engineering 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
the Department of Information and Electronics 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
- Linear Complexity of Periodic Sequences Obtained from GF(q) sequences with Period q^n-1 by One-Symbol Insertion
- On p-Ary Bent Sequences
- A Derivation of the Phase Difference between n-Tuples of an M-Sequence by Arithmetic over a Finite Field