Abstract: A new self-shrinking model on [GF(3)] constructed with modular addition is presented. The upper bound of the period is [3n], the lower bound is [32n3]; the upper bound of the linear complexity is [3n], the lower bound is [32n3-1]. For the period and complexity of primitive trinomials and primitive quarternomials, the probability achieving better bound value are [89], [56].

Key words: self-shrinking sequence, period, linear complexity, primitive trinomials, primitive quarternomials

摘要： 对[GF(3)]上通过模加实现的新型自缩序列模型进行研究，得到序列周期上界为[3n]，下界为[32n3]；线性复杂度上界为[3n]，下界为[32n3-1]。对于本原三项式和四项式的自缩序列的周期和线性复杂度达到更优界值的概率分别为[89]和[56]。

关键词: 自缩序列, 周期, 线性复杂度, 本原三项式, 本原四项式