On the Linear Complexity of Some Ternary Sequences with Ideal Autocorrelation

Abstract

In this letter, we examine the linear complexity of some 3-ary sequences, proposed by No, of period 3n-1 (n=3ek, e, k integer) with the ideal autocorrelation property. The exact value of linear complexity k(6e)w is determined when the parameter r=w∑i=13ei. Furthermore, the upper bound of the linear complexity is given when the other forms of the value r is taken. Finally, a Maple program is designed to illustrate the validity of the results.