Name
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 = Σi=1w 3ei. 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. |
Year | DOI | Venue |
|---|---|---|
2008 | 10.1093/ietfec/e91-a.2.709 | IEICE Transactions |
Keywords | Field | DocType |
3-ary sequence,linear complexity,k integer,ideal autocorrelation,ternary sequences,ideal autocorrelation property,value r,linear complexity k,parameter r,maple program,exact value,trace function,upper bound | Maple,Integer,Discrete mathematics,Combinatorics,Upper and lower bounds,Ternary operation,Trace (linear algebra),Linear complexity,Mathematics,Autocorrelation | Journal |
Volume | Issue | ISSN |
E91-A | 2 | 1745-1337 |
Citations | PageRank | References |
0 | 0.34 | 5 |
Authors | ||
4 | ||
Name | Order | Citations | PageRank |
|---|---|---|---|
| Xiaoni Du | 1 | 182 | 16.46 |
| Yu Zhou | 2 | 0 | 0.68 |
| Rong Sun | 3 | 0 | 0.34 |
| GuoZhen Xiao | 4 | 239 | 28.18 |