• The Journal of Korean Institute of Communications and Information Sciences
• /
• v.18 no.8
• /
• pp.1128-1135
• /
• 1993

In this paper, new binary cyclic codes (hereafter, refered to as GMW code) which are generated by using GMW sequence, g(t) = tr((trk(a))r), and its cyclic shifts are introduced. Code length of GMW codes is 2a-1, where k is composite integer, e·J. Dimension of the GMW codes is k(k/j)w-1, where w is a Hamming weight of r. Several properties of GMW codes such as designed distance, minimum distance, and weights of code words are obtained in terms of parameters of GMW sequences. And expansion of GMW sequences in terms of m-sequence and its decimation sequences are introduced and characteristic polynomials of GMW sequences are also derived.

• The Journal of the Korea institute of electronic communication sciences
• /
• v.7 no.2
• /
• pp.271-277
• /
• 2012

In this paper, we introduce the extended sequences of sequences generated by GMW sequences and No sequences. And we analyze cross-correlatons of the extended sequences. Also we give extended sequences which are constructed from Legendre sequences. This is helpful to a cryptosystem and a communication system. Particularly this study is useful to the CDMA system signal design.

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

• 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 the Korea institute of electronic communication sciences
• /
• v.6 no.4
• /
• pp.539-544
• /
• 2011

Balanced binary sequences of period $2^n-1(n{\geq}1)$ having the two-valued autocorrelation function have many applications in spread-spectrum communications system. In this paper we propose new nonlinear binary sequences which are constructed from Legendre sequences with the same cross-correlation as the sequences proposed by Cho. These sequences include the m-sequences, GMW sequences, Kasami sequences and No sequences which are described in terms of the trace function over a finite field. Also the proposed sequences have more low cross-correlation distribution than the quadratic form sequences proposed by Klapper.

• Journal of the Korea Institute of Information and Communication Engineering
• /
• v.16 no.4
• /
• pp.730-736
• /
• 2012

PN(Pseudo Noise) sequences play an important role in wireless communications, such as in a CDMA(code division multiple access) communication system. If there is a crash when multiple users simultaneously connected to a system, then PN sequences with low correlation help to minimize multiple access interference in such communication system. In this paper we propose a family of non-linear extended binary sequences with low cross-correlations and the family include $m$-sequence, GMW sequence, Kasami sequence and No sequence with optimal cross-correlation in terms of Welch bound. And we analyze cross-correlation of these sequences.

• Journal of the Korea Institute of Information and Communication Engineering
• /
• v.17 no.3
• /
• pp.619-626
• /
• 2013

The design of PN(Pseudo Noise) sequences with good cross-correlation properties is important for many research areas in communication systems. In this paper we propose new family of binary sequences $S^r=\{Tr_1^m\{[Tr_m^n(a{\alpha}^t+{\alpha}^{dt})]^r\}{\mid}a{\in}GF(2^n),\;0{\leq}t<2^n-1\}$ composed of Gold-like sequences and find the value of cross-correlation function when $d=2^{n-1}(3{\cdot}2^m-1)$, where n=2k, gcd(r, $2^m-1$)=1. Also we analyze the linear span of $S^r$ for some special r. Proposed sequences are extension of Gold-like sequences and GMW-sequences.

• Journal of Electrical Engineering and information Science
• /
• v.2 no.6
• /
• pp.217-222
• /
• 1997

Recently, No et al. presented a new construction of binary sequences with ideal autocorrelation property. In this paper, we applied this method into some of the well-known binary sequences with ideal autocorrelation, and the results are described in detail. First, the GMW sequences are shown to be a natural extension of m-sequences with respect to this method. Second, new binary sequences with ideal autocorrelation property are explicitly constructed from Legendre sequences, Hall's sextic residue sequences, and other known sequences of miscellaneous type.

• The Journal of the Korea institute of electronic communication sciences
• /
• v.6 no.1
• /
• pp.13-19
• /
• 2011

Games gave the calculation method for the crosscorrelation function of a Kasami sequence and a No sequence that have been generated by the same primitive polynomial. In this paper, we calculate the crosscorrelation function of a Kasami sequence and a No sequence that have been generated by the same primitive polynomial with the periodic crosscorrelation function of two base sequences. Our method is different from the Games's method.