• Journal of Information Technology Services
• /
• v.10 no.2
• /
• pp.247-257
• /
• 2011

In this paper, we propose a multiple-disseminators determining mechanism for Efficient Code Dissemination with low-delay(ECoDi) for wireless sensor networks (WSN). Code dissemination is in the spotlight as an important research issue since sensor nodes are necessary for updating new software remotely or fixing bugs dynamically. In particular, the time factor for code dissemination is the most important factor in order that the normal operation of nodes can be continuously performed as soon as finishing the dissemination. For this factor, ECoDi determines the set of disseminators through regression analysis based on the size of distributed code and the time of past unicasts and broadcasts. Then it transmits the entire code as a unicast to multiple disseminators, and the disseminators broadcast the code to the remaining neighbor nodes. Performance results on a testbed show that ECoDi reduces dissemination time significantly compared to a conventional scheme.

• IEMEK Journal of Embedded Systems and Applications
• /
• v.1 no.2
• /
• pp.31-36
• /
• 2006

As two dimensional bar code can collect data and information quickly, it is used and recognized as a useful tool for the many industrial application field. But the information capacity of two dimensional bar code is still limited. Recently, the two dimensional AD bar code (analog-digital code) that can increase its application range and overcome capacity limitation is developed. In this paper, we implement an effective system which can transform text information into voice using two dimensional AD bar code and TTS(Text To Speech). It can be transmitted to blind people by capturing the AD bar code on the papers or the books.

• Proceedings of the Korean Society of Precision Engineering Conference
• /
• 2002.10a
• /
• pp.591-594
• /
• 2002

Generating NC-code from 3D part model needs a lot of effort to make many decisions, including machining area, tool change data, tool data, cutting condition, etc., by using either manual or computer aided method. This effort can be reduced by integration of automated process planning and NC-code generation. In case of generating NC code with a help of the process planning system, many data mentioned from the process planning can be used. It means that we can create NC-code about a full part. In this study, integration of FAPPS(Feature based Automatic Process Planning) with a NC-code generating module is described and additional data to adapt NC-code for machine shop is discussed.

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

• International Journal of Advanced Culture Technology
• /
• v.8 no.2
• /
• pp.289-296
• /
• 2020

Software copyright are written in text form of documents and stored as files, so it is easy to expose on an illegal copyright. The IOT framework configuration and service environment are also evaluated in software structure and revealed to replication environments. Illegal copyright can be easily created by intelligently modifying the program code in the framework system. This paper deals with similarity comparison to determine the suspicion of illegal copying. In general, original source code should be provided for similarity comparison on both. However, recently, the suspected developer have refused to provide the source code, and comparative evaluation are performed only with executable code. This study dealt with how to analyze the similarity with the execution code and the circuit configuration and interface state of the system without the original source code. In this paper, we propose a method of analyzing the data of the object without source code and verifying the similarity comparison result through evaluation examples.

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

• Journal of the Korea Society of Computer and Information
• /
• v.24 no.2
• /
• pp.35-40
• /
• 2019

In this paper, we propose a technique to reconstruct the iris image from the iris code by analyzing the process of generating the iris code and calculating it inversely. Iris recognition is an authentication method for authenticating an individual's identity by using iris information of an eye having unique information of an individual. The iris recognition extracts the features of the iris from the iris image, creates the iris code, and determines whether to authenticate using the corresponding code. The iris recognition method using the iris code is a method proposed by Daugman for the first time and is widely used as a representative method of iris recognition technology currently used commercially. In this paper, we restore the iris image with only the iris code, and test whether the reconstructed image and the original image can be recognized, and analyze restoration vulnerability of Daugman's iris code.