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

In this paper, a new extending method of q-ary low correlation zone(LCZ) sequence sets is proposed, which is a generalization of binary LCZ sequence set by Kim, Jang, No, and Chung. Using this method, q-ary LCZ sequence set with parameters (N,M,L,${\epsilon}$) is extended as a q-ary LCZ sequence set with parameters (pN,pM,p[(L+1)/p]-1,p${\epsilon}$), where p is prime and p|q.

• Journal of the Institute of Electronics Engineers of Korea TC
• /
• v.45 no.7
• /
• pp.17-21
• /
• 2008

As with the binary pseudo-random sequences q-ary m-sequences possess very good properties which make them useful in many applications. So we construct a class of Jacket matrices by applying additive characters of the finite field $F_q$ to entries of all shifts of q-ary m-sequence. In this paper, we generalize a method of obtaining conventional Hadamard matrices from binary PN-sequences. By this way we propose Jacket matrix construction based on q-ary M-sequences.

• 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.

• The Journal of Korean Institute of Communications and Information Sciences
• /
• v.28 no.9C
• /
• pp.835-842
• /
• 2003

For an odd prime p and integer n, m and k such that n=(2m＋1)ㆍk, a new family of p-ary sequences of period p$^{n}$ -1 with optimal correlation property is constructed using the p-ary Helleseth-Gong sequences with ideal autocorrelation, where the size of the sequence family is p$^{n}$ . That is, the maximum nontrivial correlation value R$_{max}$ of all pairs of distinct sequences in the family does not exceed p$^{n}$ 2/ ＋1, which means the optimal correlation property in terms of Welch's lower bound. It is also derived that the linear span of the sequences in the family is (m＋2)ㆍn except for the m-sequence in the family.

• The Journal of Korean Institute of Communications and Information Sciences
• /
• v.32 no.10C
• /
• pp.959-964
• /
• 2007

In this paper, for a positive integer M and a prime p such that $M|p^n-1$, families of M-ary sequences using the M-ary Sidel'nikov sequences with period $p^n-1$ are constructed. The family has its maximum magnitude of correlation values upper bounded by $3\sqrt{p^{n}}+6$ and the family size is $(M-1)^2(2^{n-1}-1)$+M-1 for p=2 or $(M-1)^2(p^n-3)/2+M(M-1)/2$ for an odd prime p.

• The Journal of the Korea institute of electronic communication sciences
• /
• v.7 no.4
• /
• pp.821-826
• /
• 2012

p-ary sequences of period $N=2^k-1$ are widely used in many areas of engineering and sciences. Some well-known applications include coding theory, code-division multiple-access (CDMA) communications, and stream cipher systems. The analysis of cross-correlations of these sequences is a very important problem in p-ary sequences research. In this paper, we analyze cross-correlations of p-ary sequences which is associated with the equation $(x+1)^d=x^d+1$ over finite fields.

• The Journal of Korean Institute of Communications and Information Sciences
• /
• v.33 no.7C
• /
• pp.534-539
• /
• 2008

For an odd prime p, n=4k, and $d=((p^{2k}+1)/2)^2$, Seo, Kim, No, and Shin derived the correlation distribution of p-ary m-sequence of period $p^n-1$ and its decimated sequences by d. In this paper, two new families of p-ary sequences with family size $p^{2k}$ and maximum correlation magnitude $[2]sqrt{p^n}-1$ are constructed. The linear complexity of new p-ary sequences in the families are derived in the some cases and the upper and lower bounds of their linear complexity for general cases are presented.

• The Journal of Korean Institute of Communications and Information Sciences
• /
• v.32 no.10C
• /
• pp.929-934
• /
• 2007

In this paper, we enumerate the number of distinct autocorrelation distributions that M-ary Sidel'nikov sequences can have, while we change the primitive element for generating the sequence. Let p be a prime and $M|p^n-1$. For M=2, there is a unique autocorrelation disuibution. If M>2 and $M|p^k+1$ for some k, $1{\leq}k, then the autocorrelatin distribution of M-ary Sidel'nikov sequences is unique. If M>2 and $M{\nmid}p^k+1$ for any k, $1{\leq}k, then the autocorrelation distribution of M-ary Sidel'nikov sequences is less than or equal to ${\phi}(M)/k'(or\;{\phi}(M)/2k')$, where k' is the smallest integer satisfying $M|p^{k'}-1$.

• 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.