• 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.15 no.1
• /
• pp.43-50
• /
• 1990

Using the trace mapping, we suggest the generating algorithm of non-binary GMW code sequences, to expand the ground field GF(2) into GF(p), p>2. And constructing non-binary GMW code sequences over GF(3) and GF(5), respectively, it is shown that they have the Hamming autocorrelation functions identical to m-sequences, non-linearity to improve the disadvantages of linearity, and balance properties.

• 제어로봇시스템학회:학술대회논문집
• /
• 1987.10a
• /
• pp.832-835
• /
• 1987

This paper proposes a new method of generating binary random sequences using a randomly sampled M-sequence. In this paper two methods of sampling are proposed. Expected values of the autocorrelation function of the sequence generated by these methods are calculated theoretically. From the results of computer simulation, it is shown that using these methods, we can get binary random sequences which have good random properties.

• Journal of the Korean Institute of Telematics and Electronics
• /
• v.26 no.12
• /
• pp.1910-1917
• /
• 1989

This paper shows the performances of asynchronous binary direct-sequence spread-spectrum multiple access communication systems with Rayleigh fading and White Gaussian noise. The performance measures considered are worst-case bit error probability and average SNR depending on code sequences and chip waveforms. The code sequences used are m-sequence and Gold sequence with period 31.The chip waveforms employed are rectangular, sinusoidal and something other chip waveforms.

• The Journal of Korean Institute of Communications and Information Sciences
• /
• v.31 no.9C
• /
• pp.846-852
• /
• 2006

The ${\kappa}$-error linear complexity is a ky measure of the stability of the sequences used in the areas of communication systems, stream ciphers in cryptology and so on. This paper introduces an efficient algorithm to determine the ${\kappa}$-error linear complexity and the corresponding error vectors of $p^m$-periodic binary sequences, where : is a prime and 2 is a primitive root modulo $p^2$. We also give a new sense about the ${\kappa}$-error linear complexity in viewpoint of coding theory instead of cryptographic results. We present an efficient algorithm for decoding binary cyclic codes of length $p^m$ and derive key properties of the minimum distance of these codes.

• Journal of the Korea Institute of Information and Communication Engineering
• /
• v.2 no.4
• /
• pp.511-517
• /
• 1998

In this paper a new technique to generate spreading code sequences in the CDMA communication is introduced. It is an effective method to generate optimal code sequences using the orthogonality of wavelet packet basis set of subspaces. With a three-stage Quadrature Mirror Filter(QMF), generation of optimal code sequences has been demonstrated. Since these generated optimal code sequences are non-binary and have an arbitrary waveform which is different from that of the conventional PN-based Gold code sequences, a strong security against the intended interceptor is feasible. Encouraging good correlation properties are also achieved with this new method.

• The Journal of Korean Institute of Communications and Information Sciences
• /
• v.25 no.6B
• /
• pp.1136-1142
• /
• 2000

In this paper, we present a construction for binary sequences {s(t)} of period N= \ulcorner-1 for an odd prime \ulcornerbased on the polynomial (z+1)d+az d +b, and discuss them in some cases of parameters p, m, d, a and b. We show that new sequences from our construction are balanced or almost balanced, and have optimal three-level autocorrelation. We also derive the distribution of autocorrelation values they take on. The sequences satisfy constant-on-the-coset property, and we will show that there are more than one characteristic phases with constant-on-the-coset property. Some other interesting properties of these sequences will be presented. Results of an extensive computer search are summarized.

• Journal of Communications and Networks
• /
• v.14 no.3
• /
• pp.230-236
• /
• 2012

Based on the known binary sequence sets and Gray mapping, a new method for constructing quaternary sequence sets is presented and the resulting sequence sets' properties are investigated. As three direct applications of the proposed method, when we choose the binary aperiodic, periodic, and Z-complementary sequence sets as the known binary sequence sets, the resultant quaternary sequence sets are the quaternary aperiodic, periodic, and Z-complementary sequence sets, respectively. In comparison with themethod proposed by Jang et al., the new method can cope with either both the aperiodic and periodic cases or both even and odd lengths of sub-sequences, whereas the former is only fit for the periodic case with even length of sub-sequences. As a consequence, by both our and Jang et al.'s methods, an arbitrary binary aperiodic, periodic, or Z-complementary sequence set can be transformed into a quaternary one no matter its length of sub-sequences is odd or even. Finally, a table on the existing quaternary periodic complementary sequence sets is given as well.

• Journal of the Korea Institute of Information Security & Cryptology
• /
• v.7 no.3
• /
• pp.11-22
• /
• 1997

The number of output sequence was proposed as a characteristic of binary sequence generators for cryptographic application, but in general most of binary sequence generators have single number of output sequence. In this paper, we propose two types of binary sequence generators with a large number of output sequences. The first one is a Switched-Tap LFSR (STLFSR) and it applies to the generalized nonlinear function and the Geffe's generator as example. The other is a generalized memory sequence generator(GMEM-BSG) which is an improved version of the Golic's memory sequence generator (MEM-BSG) with a large number of output sequences, and its period, linear complexity, and the number of output sequence are derived.

• The Journal of Korean Institute of Communications and Information Sciences
• /
• v.23 no.5
• /
• pp.1165-1172
• /
• 1998

In this paper, we present a construction for binary pseudorandom sequences of period $2^{m}-1$ with ideal autocorraltion property using the polynomial $z^{d}+(z+1)^{d}$. We show that the sequence obtained from the polynomial becomes an m-sequence for certain values of d. We also find a few values of d which yield new binary sequences with ideal autocorrelation property when m is $3k{\pm}1$, where k is a positive integer. These new sequences are represented using trace function and the results are tabulated.