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

• 제어로봇시스템학회:학술대회논문집
• /
• 1992.10b
• /
• pp.240-244
• /
• 1992

A new method for generation of binary random sequences, called random sampling method, has been proposed by the authors. However, the random sampling method has the defect that binary random sequence can not be rapidly generated. In this paper, two methods based on the random sampling method are proposed for fast generation of binary random sequences. The optimum conditions for obtaining ideal binary random sequences are derived.

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

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

In this paper, we present a closed-form expression of binary sequences of longer period with ideal autocorrelation property in a trace representation, if a given binary sequence with ideal autocorrelation property is described using the trace function. We also enumerate the number of cyclically distinct binary sequences of a longer period with ideal autocorrelation property, which are extended from a given binary sequence with ideal autocorrelation property.

• Bulletin of the Korean Mathematical Society
• /
• v.29 no.1
• /
• pp.89-99
• /
• 1992

In this paper we will prove some theorems on the period and the linear complexity of certain sequences in GF(q) which are generated by combining two sequences in a reasonable way. In fact these theorems are generalizations of the main result in [1]. A sequence of elements of GF(2) is called a binary sequence. In recent years considerable interest has been shown in the generation of binary sequences which have good properties. Such binary sequences play an important role in a stream cipher system.

• The Journal of Korean Institute of Communications and Information Sciences
• /
• v.22 no.3
• /
• pp.557-561
• /
• 1997

In this paper, we present three new classes of binary pseudorandom sequences of period ${2_n}-1$ with ideal autocorrelation. These sequences are newly found by an extensive computer search, and the conjectures on the construction of these sequences are formulated. We also classify the binary sequences of period ${2_n}-1$ with ideal autocorrelation, and enumerate them.

• Journal of the Korean Institute of Telematics and Electronics A
• /
• v.32A no.10
• /
• pp.1-7
• /
• 1995

In this paper, the properties of autocorrelation function of binary sequences are investigated. From these properties, the binary sequences which can be used for measurement of impulse response on fading channel are found by computer search. A receiver which can measure impulse response by use of these binary sequences is devised. This devised measurement system produces zero values of autocorrelation function for the all delays except zero sight.

• The Journal of Korean Institute of Communications and Information Sciences
• /
• v.27 no.1A
• /
• pp.35-41
• /
• 2002

In this paper, we generalize the family of binary bent sequences introduced by Olsen, Scholtz and Welch [2] to obtain the generalized binary bent sequences with optimal correlation and balance properties. The modified trace transform is introduced and it enables us to use linear function from ${F_{2^n}}$ to the intermediate field ${F_{2^e}}$, where e|n. If we choose e=1, our method becomes the conventional binary bent sequence case. Also, some examples are given which show that our construction gives the family of simple binary sequences with optimal correlation and balance properties.

• 제어로봇시스템학회:학술대회논문집
• /
• 1989.10a
• /
• pp.979-983
• /
• 1989

This paper proposes a new concept, called merit factor Fr, for evaluating the randomness of binary random sequences. The merit factor Fr is obtained from the expected values of the autocorrelation function of the binary random sequence. Using this merit factor Fr, randomness of the binary random sequences generated by the random sampling method is evaluated.

• The Transactions of the Korea Information Processing Society
• /
• v.7 no.5
• /
• pp.1474-1481
• /
• 2000

The number of keystream cycle sequences has been proposed as a characteristic of binary sequence generator for cryptographic application, but in general the most of binary sequence generators have a single cycle. On the other hand, S-box has been used to block cipher for a highly nonlinear element and then we apply it to the stream cipher with a high crypto-degree. In this paper, we propose a multiple-cycle binary sequence generator based on S-box which has a high nonlinearity containing SAC property and analyze its period, linear complexity, randomness and the number of keystream cycle sequences.