• The Transactions of the Korea Information Processing Society
• /
• v.7 no.7
• /
• pp.2149-2160
• /
• 2000

Recently many efforts on the development of automatic processing system for delivery sequence sorting have been performed in ETRI, which requires the use of postal4-state bar code system to encode delivery points. The 4-state bar code called postal 4-state barcode for high speed processing that has been specifically designed for information processing of logistics and automatic processing of he mail items. The Information of 4-state bar code indicates mail data such as post code, delivery sequence number, error correction code worked, customer information, and a unique ID. This appear addresses the issue on he reduction of reading error in postal 4-state raster beam based bar code reader. The raster beam scanning features are the unequally distributed number of spots per each unit, which cause reading errors. We propose a method for reducing the bar code reading error by adjusting measured values of bar code width to its average value over each interval. The test results show that the above method reduces the average reading error rate approximately by 99.88%.

• Journal of the Institute of Electronics Engineers of Korea SD
• /
• v.43 no.7 s.349
• /
• pp.7-12
• /
• 2006

A simple 6-ary(3, 10) runlength-limited(RLL) code for a six-level optical recording channel is presented. The proposed code can be represented by a finite state diagram with six states. The code is given achieving coding density of $3.33bits/T_{min}$, which is 96.6% efficient.

• Journal of the Korea Institute of Information and Communication Engineering
• /
• v.5 no.6
• /
• pp.1184-1189
• /
• 2001

In this paper was analyzed the performance of turbo code using semi-random interleaver which proposed a reference numbers 11. Which was analyzed comparison the performance of between the current mobile communication system had been used the viterbe decoding algorithm of convolutional code and turbo codes when fixed constraint length. The result was defined that the performance of turbo code rose a $E_{b/}$ $N_{o}$=4.7[㏈] than convolutional code, when convolutional code and turbo code was fixed by BER = 10$^{-4}$ and constraint length K 5.5.5.

• The Journal of Korean Institute of Communications and Information Sciences
• /
• v.29 no.2C
• /
• pp.181-186
• /
• 2004

Recently, there has been intensive focus on Turbo Product Codes(TPCs) which have low decoding complexity and achieve near-optimum performances at high code-rate. This paper present a parallel algorithm of turbo product codes enable simultaneous decoding of row and column. The row and column decoders operate in parallel and update each other after row and column has been decoded. simulation results show that the performance of proposed parallel turbo code is almost the same as that conventional scheme for several turbo product codes.

• Journal of the Institute of Electronics Engineers of Korea SD
• /
• v.45 no.3
• /
• pp.29-35
• /
• 2008

Very efficient 6-ary runlength-limited codes for a six-level optical recording channel are presented when d = 3. The 6-ary(3, 15) code of rate 6/7 is given achieving coding efficiency of 98.87%. The efficiency of rate 13/15, (3, 20) code is 99.95%, which approaches the Shannon capacity. To increase the accurary of reading 6-ary signal, partial response modes are also investigated.

• The Journal of Korean Institute of Communications and Information Sciences
• /
• v.30 no.2C
• /
• pp.1-9
• /
• 2005

Code is a set of words. If, for any pair of words in the code, one is not prefix of another, the code is called "Prefix(-Free) Code". The prefix coding problem is, given n, to find an optimal code with the minimum-sum of lengths of n words. As a special case of this, we present a method to find, given language L in some specific classes of regular languages, an optimal code among prefix codes in L. We also show how the structure of optimal codes varies as n grows, using trees.

• Proceedings of the Korean Information Science Society Conference
• /
• 2005.07a
• /
• pp.490-492
• /
• 2005

본 논문에서는 별도의 충돌 방지 메커니즘이 필요 없는 orthogonal code를 태그 ID로 부여함으로써 태그 인식을 간단하게 하는 메커니즘에 대해 설명한다. 첫 번째 적용 메커니즘으로 Local환경에서 Orthogonal code가 적용될 수 있는 여러 가지 응용 분야를 제안하고 두 번째로 Orthogonal code를 기존 ID 체계의 일부분으로 사용하여 anti-collision algorithm의 효율을 높이는 방법을 제시한다. 마지막으로 orthogonal code ID의 개수가 많아짐에 따라 code bit수가 길어지는 문제를 해결하기 위하여 code를 블록화 하여 사용 bit를 줄이는 메커니즘을 제시한다.

• Proceedings of the Korea Institutes of Information Security and Cryptology Conference
• /
• 1998.12a
• /
• pp.537-545
• /
• 1998

This paper is the research about a joint coding system of source and channel coding using VF(Variable-to-fixed length) arithmetic code and BCH code. We propose a VF arithmetic coding method with EDC( Error Detecting Capability) and a joint coding method in that the VF arithmetic coding method with EDC is combined with BCH code. By combining both the VF arithmetic code with EDC and BCH code. the proposed joint coding method corrects a source codeword with t-errors in decoding of BCH code and carries out a improvement of the EDC of a codeword with more than (t＋1)-errors in decoding of the VF arithmetic coding with EDC. We examine the performance of the proposed method in terms of compression ratio and EDC.

• The Journal of Korea Institute of Information, Electronics, and Communication Technology
• /
• v.15 no.4
• /
• pp.230-236
• /
• 2022

In this paper, we propose an efficient concatenated code for both random and ISI errors on diffusion-based molecular communication channels. The proposed concatenated code was constructed by combining the ISI-mitigating code designed for ISI mitigation and the ISI-Hamming code strong against random errors, and the BER(bit error rate) performance was analyzed through simulation. In the case of the above M=1,200 channel environment, it was found that the error rate performance of the concatenated code follows the error rate performance of the ISI-mitigating code, which is strong against ISI, and follows the error rate performance of the ISI-Hamming code, which is strong against random errors, in the channel environment below M=600. In M=600~1,200, the concatenated code shows the best error rate performance among those of three codes, which is analyzed because it can correct both random errors and errors caused by ISI. In the following cases of below M=800, it can be seen that the error rate of the concatenated code and the ISI-mitigating code shows an error rate difference of about 1.0×10^-1 on average.

• Journal of the Korea Institute of Information Security & Cryptology
• /
• v.25 no.1
• /
• pp.17-30
• /
• 2015

Unlike existing widely used bytecode-centric Android application code obfuscation methodology, our scheme in this paper makes encrypted file i.e. DEX file self-extracted arbitrary Android application. And then suggests a method regarding making the loader app to execute encrypted file's code after saving the file in arbitrary folder. Encrypted DEX file in the loader app includes original code and some of Manifest information to conceal event treatment information. Loader app's Manifest has original app's Manifest information except included information at encrypted DEX. Using our scheme, an attacker can make malicious code including obfuscated code to avoid anti-virus software at first. Secondly, Software developer can make an application with hidden main algorithm to protect copyright using suggestion technology. We implement prototype in Android 4.4.2(Kitkat) and check obfuscation capacity of malicious code at VirusTotal to show effectiveness.