• The Journal of Korean Institute of Communications and Information Sciences
• /
• v.31 no.12C
• /
• pp.1150-1156
• /
• 2006

In this paper we derive some lower bounds on the linear complexity and upper bounds on the 1-error linear complexity over $F_p$ of M-ary Sidel'nikov sequences of period $p^m-1$ when $M\geq3$ and $p\equiv{\pm}1$ mod M. In particular, we exactly compute the 1-error linear complexity of ternary Sidel'nikov sequences when $p^m-1$ and $m\geq4$. Based on these bounds we present the asymptotic behavior of the normalized linear complexity and the normalized 1-error linear complexity with respect to the period.

• The Journal of Korean Institute of Communications and Information Sciences
• /
• v.33 no.9C
• /
• pp.669-675
• /
• 2008

For an odd prime p, n=4k and $d=((p^2k+1)/2)^2$, there are $(p^{2k}+1)/2$ distinct decimated sequences, s(dt+1), $0{\leq}l<(p^{2k}+1)/2$, of a p-ary m-sequence, s(t) of period $p^n-1$. In this paper, it is shown that the cross-correlation function between s(t) and s(dt+l) takes the values in $\{-1,-1{\pm}\sqrt{p^n},-1+2\sqrt{p^n}\}$ and their, cross-correlation distribution is also derived.

• East Asian mathematical journal
• /
• v.15 no.2
• /
• pp.153-163
• /
• 1999

We study how the $p_n$-sequence of a universal algebra determine the structure of the algebra. Regarding term equivalent algebras as the same algebras, we consider the problem when the algebras are groupoids.

• The Journal of Korean Institute of Communications and Information Sciences
• /
• v.33 no.1C
• /
• pp.6-11
• /
• 2008

From a periodic sequence, we can obtain new sequences with a longer period by r-symbol insertion to each period. In this paper we review previous results on the linear complexity of periodic sequences obtained by r-symbol insertion. We derive the distribution of the linear complexity of 1-symbol insertion sequences obtained from m-sequences over GF(p), and prove some relationship between their linear complexity and the insertion position. Then, we analyze the k-error linear complexity of the 1-symbol insertion sequences from binary m-sequences.

• Journal of the Korea Institute of Information Security & Cryptology
• /
• v.12 no.1
• /
• pp.21-32
• /
• 2002

In this paper, for any prime q, new cyclic difference sets with Singer parameter equation omitted are constructed by using the q-ary sequences (d-homogeneous functions) of period $q_n$-1. When q is a power of 3, new cyclic difference sets with Singer parameter equation omitted are constructed from the ternary sequences of period $q_n$-1 with ideal autocorrealtion found by Helleseth, Kumar and Martinsen.

• Proceedings of the Korean Institute of Communication Sciences Conference
• /
• 2006.07a
• /
• pp.320-320
• /
• 2006

• Journal of the Korea Institute of Information Security & Cryptology
• /
• v.12 no.2
• /
• pp.11-20
• /
• 2002

In this paper, for many prime power q, it is shown that new cyclic relative difference sets with parameters (equation omitted) can be constructed by using d-homogeneous functions on $F_{q^{n}}${0} over $F_{q}$ with difference-balanced property, where $F_{q^{n} }$ is a finite field with $q^{n}$ elements. Several new cyclic relative difference sets with parameters (equation omitted) are constructed by using p-ary sequences of period $q^{n}$ -1 with ideal autocorrelation property introduced by Helleseth and Gong and d-form sequences.

• Journal of Communications and Networks
• /
• v.3 no.4
• /
• pp.361-364
• /
• 2001

Over an additive abelian group G of order g and for a given positive integer $\lambda$, a generalized Hadamard matrix GH(g, $\lambda$) is defined as a gλ$\times$gλ matrix[h(i, j)], where 1 $\leq i \leqg\lambda and 1 \leqj \leqg\lambda$, such that every element of G appears exactly $\lambd$atimes in the list h($i_1, 1) -h(i_2, 1), h(i_1, 2)-h(i_2, 2), …, h(i_1, g\lambda) -h(i_2, g\lambda), for any i_1\neqi_2$. In this paper, we propose a new method of expanding a GH(g^m, \lambda_1) = B = [B_{ij}] over G^m$ by replacing each of its m-tuple B_{ij} with B_{ij} + GH(g, $\lambda_2) where m = g\lambda_2. We may use g^m/\lambda_1 (not necessarily all distinct) GH(g, \lambda_2$)s for the substitution and the resulting matrix is defined over the group of order g.