Maximum Order Complexity for the Minimum Changes of an M-Sequence
Summary :
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 will give the bounds (lower and upper bounds) of MOC for the minimum changes of an m-sequence over GF(q) with period qn-1, which shows that MOC is much more natural than LC as a measure for the randomness of sequences in this case.
- Publication
- IEICE TRANSACTIONS on Fundamentals Vol.E81-A No.11 pp.2407-2411
- Publication Date
- 1998/11/25
- Publicized
- Online ISSN
- DOI
- Type of Manuscript
- Category
- Information Security
Authors
Keyword
Latest Issue
Copyrights notice of machine-translated contents
The copyright of the original papers published on this site belongs to IEICE. Unauthorized use of the original or translated papers is prohibited. See IEICE Provisions on Copyright for details.
Cite this
Copy
Satoshi UEHARA, Tsutomu MORIUCHI, Kyoki IMAMURA, "Maximum Order Complexity for the Minimum Changes of an M-Sequence" in IEICE TRANSACTIONS on Fundamentals,
vol. E81-A, no. 11, pp. 2407-2411, November 1998, doi: .
Abstract: 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 will give the bounds (lower and upper bounds) of MOC for the minimum changes of an m-sequence over GF(q) with period qn-1, which shows that MOC is much more natural than LC as a measure for the randomness of sequences in this case.
URL: https://global.ieice.org/en_transactions/fundamentals/10.1587/e81-a_11_2407/_p
Copy
@ARTICLE{e81-a_11_2407,
author={Satoshi UEHARA, Tsutomu MORIUCHI, Kyoki IMAMURA, },
journal={IEICE TRANSACTIONS on Fundamentals},
title={Maximum Order Complexity for the Minimum Changes of an M-Sequence},
year={1998},
volume={E81-A},
number={11},
pages={2407-2411},
abstract={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 will give the bounds (lower and upper bounds) of MOC for the minimum changes of an m-sequence over GF(q) with period qn-1, which shows that MOC is much more natural than LC as a measure for the randomness of sequences in this case.},
keywords={},
doi={},
ISSN={},
month={November},}
Copy
TY - JOUR
TI - Maximum Order Complexity for the Minimum Changes of an M-Sequence
T2 - IEICE TRANSACTIONS on Fundamentals
SP - 2407
EP - 2411
AU - Satoshi UEHARA
AU - Tsutomu MORIUCHI
AU - Kyoki IMAMURA
PY - 1998
DO -
JO - IEICE TRANSACTIONS on Fundamentals
SN -
VL - E81-A
IS - 11
JA - IEICE TRANSACTIONS on Fundamentals
Y1 - November 1998
AB - 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 will give the bounds (lower and upper bounds) of MOC for the minimum changes of an m-sequence over GF(q) with period qn-1, which shows that MOC is much more natural than LC as a measure for the randomness of sequences in this case.
ER -
English
