• Journal of Electrical Engineering and information Science
• /
• v.1 no.1
• /
• pp.91-97
• /
• 1996

This paper proves by straightforward computation an interesting property of a recursive indexing: it preserves the entropy of a geometrically-distributes stationary memoryless source. This result is a pleasant surprise because the recursive indexing though one-to-one, is a symbol-to-string mapping and the entropy is measured in terms of the source symbols. This preservation of the entropy implies that the minimum average number of bits needed to represent a geometric memoryless source by the recursive indexing followed by a good binary encoder of a finite imput alphabet remains the same as that by a good encoder of an infinite input alphabet. Therefore, the recursive indexing theoretically keeps coding optimality intact. For this reason recursive indexing can provide an interface for a binary code with a finite code book that performs reasonably well for a source with an infinite alphabet.

• Journal of Biomedical Engineering Research
• /
• v.15 no.1
• /
• pp.83-88
• /
• 1994

The transform trellis code is an optimal source code as a block size and the constraint length of a shift register go to infinite for stationary Gaussian sources with the squared-error distortion measure. However to implement this code, we have to choose the finite block size and constraint length. Moreover real-world sources are inherently non stationary. To overcome these difficulties, we developed a training algorithm for the transform trellis code. The trained transform trellis code which uses the same rates to each block led to a variation in the resulting distortion from one block to another. To alleviate this non-uniformity in the encoded image, we constructed clusters from the variance of the training data and assigned different rates for each cluster.

• Bulletin of the Korean Mathematical Society
• /
• v.52 no.4
• /
• pp.1375-1382
• /
• 2015

We investigate what happens when we try to work with continuing block codes (i.e., left or right continuing factor maps) between shift spaces that may not be shifts of finite type. For example, we demonstrate that continuing block codes on strictly sofic shifts do not behave as well as those on shifts of finite type; a continuing block code on a sofic shift need not have a uniformly bounded retract, unlike one on a shift of finite type. A right eresolving code on a sofic shift can display any behavior arbitrary block codes can have. We also show that a right continuing factor of a shift of finite type is always a shift of finite type.

• Proceedings of the Earthquake Engineering Society of Korea Conference
• /
• 2000.04a
• /
• pp.55-62
• /
• 2000

In constructing a synthetic seismogram using ray-tracing method a suite of ray-code is required to obtain a realistic seismogram which is similar to the actual seismogram or earthquake record under consideration. An infinite number of rays exist for any arbitrarily located source and receiver. One select only a finite number of such rays in computing a synthetic seismogram so their selection becomes important to the validity of the seismogram being generated. Missing certain important rays or an inappropriate selection of ray-codes in tracing rays may result in wrong interpretation of the earthquake record or seismogram. Automatic ray-code generation will eliminate such problems. In this study we have developed an efficient algorithm, with which one can generate systemastically all the ray-codes connecting source and receiver arbitrarily located. The result of this work will helpful in analysing multiple reflections in seismic data processing as well as simulating Lg wave and multiply reflected or converted phases in earthquake study.

• Journal of Satellite, Information and Communications
• /
• v.9 no.2
• /
• pp.114-118
• /
• 2014

In this paper, we analyze the performance of a concatenated code with two different inner decoding schemes. One is the error-detecting inner decoding, and the other is the error-detecting-and-correcting inner decoding scheme. We compare the performances of the two decoding schemes for finite and infinite block length cases when the concatenated code is applied to slow frequency-hopping spread-spectrum multiple access (FH-SSMA) communication systems.

• Journal of the Korean Mathematical Society
• /
• v.58 no.1
• /
• pp.29-44
• /
• 2021

The set D of column vectors of a generator matrix of a linear code is called a defining set of the linear code. In this paper we consider the problem of constructing few-weight (mainly two- or three-weight) linear codes from defining sets. It can be easily seen that we obtain an one-weight code when we take a defining set to be the nonzero codewords of a linear code. Therefore we have to choose a defining set from a non-linear code to obtain two- or three-weight codes, and we face the problem that the constructed code contains many weights. To overcome this difficulty, we employ the linear codes of the following form: Let D be a subset of ��2n, and W (resp. V ) be a subspace of ��2 (resp. ��2n). We define the linear code ��D(W; V ) with defining set D and restricted to W, V by $${\mathcal{C}}_D(W;V )=\{(s+u{\cdot}x)_{x{\in}D^{\ast}}|s{\in}W,u{\in}V\}$$. We obtain two- or three-weight codes by taking D to be a Vasil'ev code of length n = 2m - 1(m ≥ 3) and a suitable choices of W. We do the same job for D being the complement of a Vasil'ev code. The constructed few-weight codes share some nice properties. Some of them are optimal in the sense that they attain either the Griesmer bound or the Grey-Rankin bound. Most of them are minimal codes which, in turn, have an application in secret sharing schemes. Finally we obtain an infinite family of minimal codes for which the sufficient condition of Ashikhmin and Barg does not hold.

• 제어로봇시스템학회:학술대회논문집
• /
• 2005.06a
• /
• pp.1132-1136
• /
• 2005

In this paper, adaptive equalizer receiver for a turbo code direct sequence code division multiple access (DSCDMA) by using least mean square (LMS) adaptive algorithm is presented. The proposed adaptive equalizer is using soft output of decision feedback adaptive equalizer (DFE) to examines the output of the equalizer and the Log- maximum a posteriori (Log-MAP) algorithm for the turbo decoding process of the system. The objective of the proposed equalizer is to minimize the bit error rate (BER) of the data due to the disturbances of noise and intersymbol interference (ISI)phenomenon on the channel of the DS-CDMA digital communication system. The computer program simulation results shown that the proposed soft output decision feedback adaptive equalizer provides a good BER than the others one such as conventional adaptive equalizer, infinite impulse response adaptive equalizer.

• Proceedings of the Korean Geotechical Society Conference
• /
• 2006.03a
• /
• pp.687-696
• /
• 2006

Slope failure triggered by rainfall produces severe effects on the serviceability and stability of railway. Therefore slope stability problem is one of the major concerns on the operation of railway. In this study we collected rainfall data when and where slope failures were observed. The collected data show that the range of cumulative rainfall is from 150 to 500mm and the rainfall duration is about 3 to 24 hours. By using the collected rainfall information, slope stability analysis considering infiltration was carried. The analyses employs multiple sliding surfaces to find the minimal factor of safety in the infinite slope condition. This approach show more reasonable results than the results from analysis following the design code which assumes that groundwater level and the slope surface are equal.

• Journal of Korea Society of Digital Industry and Information Management
• /
• v.9 no.4
• /
• pp.103-110
• /
• 2013

In Information Technology era, various amazing IT technologies, for example Big Data, are appearing and are available as the amount of information increase. The number of counselling for violation of personal data protection is also increasing every year that it amounts to over 160,000 in 2012. According to Korean Privacy Act, in the case of treating unique personal identification information, appropriate measures like encipherment should be taken. The technologies of encipherment are the most basic countermeasures for personal data invasion and the base elements in information technology. So various cryptography algorithms exist and are used for encipherment technology. Therefore studies on safer new cryptography algorithms are executed. Cryptography algorithms started from classical replacement enciphering and developed to computationally secure code to increase complexity. Nowadays, various mathematic theories such as 'factorization into prime factor', 'extracting square root', 'discrete lognormal distribution', 'elliptical interaction curve' are adapted to cryptography algorithms. RSA public key cryptography algorithm which was based on 'factorization into prime factor' is the most representative one. This paper suggests algorithm utilizing telescoping series as a safer cryptography algorithm which can maximize the complexity. Telescoping series is a type of infinite series which can generate various types of function for given value-the plain text. Among these generated functions, one can be selected as a original equation. Some part of this equation can be defined as a key. And then the original equation can be transformed into final equation by improving the complexity of original equation through the command of "FullSimplify" of "Mathematica" software.

• Geophysics and Geophysical Exploration
• /
• v.11 no.4
• /
• pp.361-367
• /
• 2008

When constructing a synthetic seismogram in the earthquake study or in seismic data interpretation by using a ray-tracing technique, the most troublesome and error-prone task is to define a suite of ray codes for the corresponding rays to trace in advance. An infinite number of rays exist for any arbitrarily located source and receiver in a medium. Missing certain important rays or an inappropriate selection of ray codes in tracing rays may result in wrong interpretation of the earthquake record or seismogram. Automatic ray code generation could be able to eliminate those problems. In this study we have developed an efficient algorithm with which one can generate systematically all the ray codes for the source(s) and receiver(s) arbitrarily located in a model. The result of this work could be used not only in analysing multiples in seismic data processing and interpretation, but also in coda wave study, study on the amplification effects in a basin and phase identification of the waves multiply reflected/refracted in earthquake study.