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

• Kyungpook Mathematical Journal
• /
• v.59 no.1
• /
• pp.23-34
• /
• 2019

In this paper, we first define generalizations of Pell and Pell-Lucas sequences by the recurrence relations $$p_n=2ap_{n-1}+(b-a^2)p_{n-2}\;and\;q_n=2aq_{n-1}+(b-a^2)q_{n-2}$$ with initial conditions $p_0=0$, $p_1=1$, and $p_0=2$, $p_1=2a$, respectively. We give generating functions and Binet's formulas for these sequences. Also, we obtain some identities of these sequences.

• Honam Mathematical Journal
• /
• v.35 no.3
• /
• pp.395-406
• /
• 2013

Generalized paper folding sequences $X^n_p$ and $(X_pY_q)^n$ where $X,Y{\in}\{R,L,U,D\}$, and $n,p,q{\in}\mathbb{N}$, and with $p,q{\geq}2$ are classified in this paper. We show that all generalized paper folding sequences $X^n_p$ are classified into one type if we classify generalize paper folding sequences along with the numbers of downwards and upwards. In addition, we investigate the numbers of downwards and upwards in $(X_pY_q)^n$ and prove that all generalized paper folding sequences $(X_pY_q)^n$ are classified into two types.

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

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

• Honam Mathematical Journal
• /
• v.34 no.3
• /
• pp.423-438
• /
• 2012

In this paper, we discuss numbers of downwards and upwards in generalized paper folding sequences. We compute the exact number of downwards and upwards in $R^n_p$ and $(R_pR_q)^n$ by using the properties of recursive sequences where n, p and q are natural numbers with $p{\geq}2$ and $q{\geq}2$.

• 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 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.28 no.10C
• /
• pp.930-935
• /
• 2003

In this paper, using bent functions defined [n the finite field we generalized the construction method of the family of p-ary bent sequences with balanced and optimal correlation property introduced by Kumar and Moreno for an odd prime p[3], called a generalized p-ary bent sequence. It turns out that the family of balanced p-ary sequences with optimal correlation property introduced by Moriuchi and Imamura [6] is a special case of the generalized p-ary bent sequences.