• Proceedings of the KIEE Conference
• /
• 2006.04a
• /
• pp.111-113
• /
• 2006

DEAS is an direct searching and optimization method that based on the binary code space. It can be classified as an direct hill climbing searching. However, because of binary code space based searching, the searching in low resolution has random property. As the resolution of code increases during the search, its property of searching changes like that of hill climbing search. This paper propose a method for improving the performance of minimum seeking ability of DEAS with history information. The cost evaluation is increased. However the minimum searching ability of DEAS is improved along the same starting resolution.

• Journal of the Korean Mathematical Society
• /
• v.43 no.6
• /
• pp.1357-1369
• /
• 2006

It is known that if C is an [24m + 2l, 12m + l, d] selfdual binary linear code with $0{\leq}l<11,\;then\;d{\leq}4m+4$. We present a sufficient condition for the nonexistence of extremal selfdual binary linear codes with d=4m+4,l=1,2,3,5. From the sufficient condition, we calculate m's which correspond to the nonexistence of some extremal self-dual binary linear codes. In particular, we prove that there are infinitely many such m's. We also give similar results for additive self-dual codes over GF(4) of length n=6m+1.

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

• 한국HCI학회:학술대회논문집
• /
• 2008.02a
• /
• pp.679-682
• /
• 2008

High interest for the wireless network is going on the research to apply the related technologies in one's real life. Among these wireless network technologies, local area wireless network, Binary CDMA(Code Division Multiple Access), is the method transferring the data by using RF band based on 2.4Ghz. Binary CDMA has longer transmission distance than Bluetooth. Also, it is of benefit to an inexpensive price because the circuit is simple as compared with being similar to the performance of the existing CDMA. Though Binary CDMA has these benefits, one problem is a frequency overlap, and anther problem is to generate the sections with the shorter distance. To solve these problems, We propose the clustering method that can cover wide area.

• The Journal of the Institute of Internet, Broadcasting and Communication
• /
• v.14 no.6
• /
• pp.281-288
• /
• 2014

QR code (abbreviated from Quick Response Code) is code system that is strong in against to apply image processing techniques (skew, warp, blur, and rotate) as QR codes can store several hundred times the amount of information carried by ordinary bar codes. For this reason, QR code is used in various fields, e.g., air ticket (boarding control system), food(vegetables, meat etc.) tracking system, contact lenses management, prescription management, patient wrist band (patient management) etc. In this paper, we proposed reversible data hiding for binary images. A reversible data hiding algorithm, which can recover the original image without any distortion from the marked (stego) image after the hidden data have been extracted, because it is possible to use various kinds of purposes. QR code can be used to generate by anyone so it can be easily used for crime. In order to prevent crimes related QR code, reversible data hiding can confirm if QR code is counterfeit or not as including authentication information. In this paper, we proved proposed method as experiments.

• The Journal of Korea Institute of Information, Electronics, and Communication Technology
• /
• v.16 no.3
• /
• pp.161-166
• /
• 2023

In recent years, new and variant hacking of binary codes has increased, and the limitations of techniques for detecting malicious codes in source programs and defending against attacks are often exposed. Advanced software security vulnerability detection technology using machine learning and deep learning technology for binary code and defense and response capabilities against attacks are required. In this paper, we propose a malware clustering method that groups malware based on the characteristics of the taint information after entering dynamic taint information by tracing the execution path of binary code. Malware vulnerability detection was applied to a three-layered Few-shot learning model, and F1-scores were calculated for each layer's CPU and GPU. We obtained 97~98% performance in the learning process and 80~81% detection performance in the test process.

• Journal of KIISE
• /
• v.44 no.10
• /
• pp.1019-1025
• /
• 2017

Binary similarity analysis is used in vulnerability analysis, malicious code analysis, and plagiarism detection. Proving that a function is equal to a well-known safe functions of different versions through similarity analysis can help to improve the efficiency of the binary code analysis of malicious behavior as well as the efficiency of vulnerability analysis. However, few studies have been carried out on similarity analysis of the same function of different versions. In this paper, we analyze the similarity of function units through various methods based on extractable function information from binary code, and find a way to analyze efficiently with less time. In particular, we perform a comparative analysis of the different versions of the OpenSSL library to determine the way in which similar functions are detected even when the versions differ.

• The Transactions of the Korea Information Processing Society
• /
• v.5 no.8
• /
• pp.2027-2040
• /
• 1998

In this paper, we present efficient reconfigurable mesh algorithms for transforming between a binary image and its corresponding boundary code. These algorithms use $n\timesn\timesn$ processors when the size of the binary image is $n\timesn$. Recent published results show that these transformations can be done in O(1) time using $O(n^4)$ processors. The number of processors used by these algorithms is very large compared to the number of pixels in the image. Here, we present fast transformation algorithms which use $n^3 processors only. the transformation from a houndary code to a binary image takes O(1) time, and the converse transformation takes O(log n) time.

• Proceedings of the Optical Society of Korea Conference
• /
• 2006.02a
• /
• pp.335-336
• /
• 2006

We propose a method of encryption and decryption of binary data using 2-step phase-shifting digital interferometry. This technique reduces the number of interferograms in the phase-shifting interferometry. The binary data has been expressed with random code and random phase. We remove the dc-term of the phase-shifting digital interferogram to restore the original binary data. Simulation results shows that the proposed technique can be used for binary data encryption and decryption.

• International journal of advanced smart convergence
• /
• v.1 no.1
• /
• pp.27-33
• /
• 2012

In this paper, we analyze and simulate performance of space time block coded (STBC) binary pulse amplitude modulation-direct sequence (BPAM-DS) ultra-wideband (UWB) systems with double binary turbo code in indoor environments for various ubiquitous healthcare (u-healthcare) applications. Indoor wireless channel is modeled as a modified Saleh and Valenzuela (SV) model proposed as a UWB indoor channel model by the IEEE 802.15.SG3a in July 2003. In the STBC encoding process, an Alamouti algorithm for real-valued signals is employed because UWB signals have the type of real signal constellation. It is assumed that the transmitter has knowledge about channel state information. From simulation results, it is shown that the STBC scheme does not have an influence on improving bit error probability performance of the BPAM-DS UWB systems. It is also confirmed that the results of this paper can be applicable for u-healthcare applications.