Linear Complexity of Periodic Sequences Obtained from a Sequence over GF(p) with Period p^n-1 by One-Symbol Deletion

スポンサーリンク

概要

• 論文の詳細を見る

• From a sequence {a_i}i≧0 over GF(p) with period p^n-1 we can obtain another periodic sequence {a_i}i≧0 with period p^n-2 by deleting one symbol at the end of each period. We will give the bounds (upper bound and lower bound) of linear complexity of {a_i}i≧0 as a typical example of instability of linear complexity. Derivation of the bounds are performed by using the relation of characteristic polynomials between {a_i}i≧0 and {a^<j>_i}i≧0={a_i+j}i≧0, j ⋵ GF(p)∖{0}. For a binary m-Sequence {a_i}i≧0 with period 2^n-1, n-1 a prime, we will give the explicit formula for the characteristic polynomial of {a_i}i≧0.

• 社団法人電子情報通信学会の論文
• 1997-06-25

著者

• Uehara Satoshi

  Faculty Of Computer Science And Systems Engineering Kyushu Institute Of Technology

• Imamura Kyoki

  Faculty Of Computer Science And Systems Engineering Kyushu Institute Of Technology

関連論文

• Characteristic Polynomials of Binary Complementary Sequences
• Balanced Binary Sequences with Optimal Periodic Correlation Properties
• Linear Complexity of Periodic Sequences Obtained from a Sequence over GF(p) with Period p^n-1 by One-Symbol Deletion
• Some Properties of Logistic Maps over Integers
• On p-Ary Bent Sequences
• Approximate Odd Periodic Correlation Distributions of Binary Sequences (Special Issue on Spread Spectrum Techniques and Applications)
• Value Distribution of Linear Complexity for p-Ary Periodic Sequences with Period p^n, p a Prime
• Some Properties of Partial Autocorrelation of Binary M-Sequences (Special Section on Information Theory and Its Applications)
• Rounding Logistic Maps over Integers and the Properties of the Generated Sequences

スポンサーリンク