• The Journal of Korean Institute of Communications and Information Sciences
• /
• v.22 no.6
• /
• pp.1273-1278
• /
• 1997

Pseudonoise sequences of period 2$^{m}$ -1 with idel autocorrelation have been researched such as m-sequences, GMW sequences, Legendre sequences, and extended sequences. The m-sequences, the GMW sequences, the Legendre sequences, and the extended sequences are best described in terms of the trace function by previous works. Besides, there are Hall's sextic residue sequences and miscellaneous sequences with ideal autocorrelation, whose general constructions are not known so far. However, are are no explicit descripton of the Hall's sextic residue sequences and the miscellaneous sequences in terms of the trace function. In this paper, the Hall's sextic residue sequences and the miscellaneous sequences of period 2$^{m}$ -1 are expressed as a sum of trace functions. The miscellaneous sequences with ideal autocorrelation, which are newly found by computer search, are also expressed as a sum of trace functions.

• 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 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 and Communication Engineering
• /
• v.15 no.10
• /
• pp.2181-2187
• /
• 2011

In this paper, a family of binary sequences generated by GMW sequences and No sequences is introduced and analyzed. Each sequence within a family has period $N=2^n-1$, n=2m and there are $2^m$ sequences within that family. We obtain auto and cross-correlation values and linear span of the synthesized sequence.

• The Journal of Korean Institute of Communications and Information Sciences
• /
• v.32 no.11C
• /
• pp.1059-1065
• /
• 2007

In this paper, we propose a class of polyphase signature sequences, whose general odd correlation properties are useful for M-ary phase signaling systems. The maximum magnitude of the general odd correlation functions of the proposed sequences are investigated and compared with those of FZC (Frank-Zadoff-Chu) sequences and those of EOE (equivalent odd and even correlation) sequences. The performance of the asynchronous M-ary phase signaling systems using the proposed sequences is simulated and compared with that using FZC sequences in direct sequence code division multiple access (DS/CDMA) systems. The performance of the system using the proposed sequence is shown to be better than that using FZC sequences when the multipath fading is in existence.

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

• Proceedings of the Korean Institute of Information and Commucation Sciences Conference
• /
• 2012.05a
• /
• pp.228-231
• /
• 2012

In this paper we propose a new family of nonlinear binary sequences generated by $m$-sequences for decimations $d=2^{k-1}(2^{s+1}-2^k+2^{k(i+1)}-2^{ki}-1)/(2^s-1)$ where $n=2k$, $i$ is odd and $s$ is such that $2s$ divides $k$. And we analyze the cross-correlation function between two $m$-sequences for new decimations $d$. Proposed sequences is extension of Rosendahl's sequnces and Dobbertin's sequences.

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

• Genomics & Informatics
• /
• v.2 no.2
• /
• pp.61-66
• /
• 2004

Fusion proteins resulting from chimeric sequences are excellent targets for therapeutic drug development. We developed a database of chimeric sequences by examining the genomic alignment of mRNA and EST sequences in the GenBank. We identified 688 chimeric mRNA and 20,998 chimeric EST sequences. Including EST sequences greatly expands the scope of chimeric sequences even though it inevitably accompanies many artifacts. Chimeric sequences are clustered according to the ECgene ID so that the user can easily find chimeric sequences related to a specific gene. Alignments of chimeric sequences are displayed as custom tracks in the UCSC genome browser. ChimerDB, available at http://genome.ewha.ac.kr/ECgene/ChimerDB/, should be a valuable resource for finding drug targets to treat cancers.