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

• The Journal of Korean Institute of Communications and Information Sciences
• /
• v.41 no.11
• /
• pp.1349-1355
• /
• 2016

It should guarantee high reliability and ultra low latency communication. Additionally, it should support connection between massive devices. As one of estimated scenarios for 5G mobile communication, mobile devices and sensors using low data rate wireless communication will increase. For communication of these devices, single-carrier system can be considered. In order to satisfy these requirements, in this paper, we propose CDMA (Code Division Multiple Access) system using complex spreading and Multi-level BPSK(Binary Phase Shift Keying). The proposed system spread transmit symbol by using chip code consisted of real and imaginary number. As simulation results, we can confirm that although the proposed system has 3dB lower BER (Bit Error Rate) performance than conventional CDMA system, the proposed system can support 2 times more users in comparison with conventional CDMA system.

• The Journal of the Institute of Internet, Broadcasting and Communication
• /
• v.10 no.5
• /
• pp.69-75
• /
• 2010

Advanced T-DMB(Terrestial DMB )system which is a new portable mobile broadcasting system has been developed to increase data rate up to double of conventional T-DMB in same bandwidth while maintaining backward compatibility, using hierarchical modulation method. The Advanced T-DMB system realize high qualification of conventional T-DMB system by adding BPSK signal or QPSK signal as enhanced layer to existing DQPSK signal. The enhanced layer signal should be small enough to maintain backward compatibility and to minimize the coverage loss of existing T-DMB service area. But this causes the enhanced layer signal of Advanced T-DMB susceptible to fading effect in transmission channel. In this paper we applied the duo-binary turbo code which has powerful error correction capability to the enhanced layer signal for compensating channel distortion. And the computer simulation results about the performance of the duo-binary turbo code in Advanced T-DMB system are presented along with analysis comments.

• Journal of the Korea Institute of Information Security & Cryptology
• /
• v.32 no.4
• /
• pp.629-635
• /
• 2022

Cyber threats are also increasing with recent social changes and the development of ICT technology. Malicious codes used in cyber threats are becoming more advanced and intelligent, such as analysis environment avoidance technology, concealment, and fileless distribution, to make analysis difficult. Machine learning technology is being used to effectively analyze these malicious codes, but a lot of effort is needed to increase the accuracy of classification. In this paper, we propose a malicious code detection technology based on API call interval characteristics to improve the classification performance of machine learning. The proposed technology uses API call characteristics for each section and entropy of binary to separate characteristic factors into sections based on the extraction malicious code and API call order of normal binary. It was verified that malicious code can be well analyzed using the support vector machine (SVM) algorithm for the extracted characteristic factors.

• Journal of the Institute of Convergence Signal Processing
• /
• v.13 no.4
• /
• pp.194-200
• /
• 2012

In this paper we analyze the code sequence generating algorism defined on $GF(2^n)$ proposed by S.Bostas and V.Kumar[7] and derive the implementation functions of code sequence generator using Boolean functions which can map the vector space $F_2^n$ of all binary vectors of length n, to the finite field with two elements $F_2$. We find the code sequence generating boolean functions based on two kinds of the primitive polynomials of degree, n=5 and n=7 from trace function. We then design and implement the code sequence generators using these functions, and produce two code sequence groups. The two groups have the period 31 and 127 and the magnitudes of out of phase(${\tau}{\neq}0$) autocorrelation and crosscorrelation functions {-9, -1, 7} and {-17, -1, 15}, satisfying the period $L=2^n-1$ and the correlation functions $R_{ij}({\tau})=\{-2^{(n+1)/2}-1,-1,2^{(n+l)/2}-1\}$ respectively. Through these results, we confirm that the code sequence generators using boolean functions are designed and implemented correctly.

• Journal of Software Assessment and Valuation
• /
• v.16 no.1
• /
• pp.37-44
• /
• 2020

The similarity of the software is extracted by the verification of comparing with the source code. The source code is the intellectual copyright of the developer written in the programming language. And the source code written in text format contains the contents of the developer's expertise and ideas. The verification for judging the illegal use of software copyright is performed by comparing the structure and contents of files with the source code of the original and the illegal copy. However, there is hard to do the one-to-one comparison in practice. Cause the suspected source code do not submitted Intentionally or unconsciously. It is now increasing practically. In this case, the comparative evaluation with execution code should be performed, and indirect methods such as reverse assembling method, reverse engineering technique, and sequence analysis of function execution are applied. In this paper, we analyzed the effectiveness of indirect comparison results by practical evaluation . It also proposes a method to utilize to the system and executable code files as a verification results.

• KSII Transactions on Internet and Information Systems (TIIS)
• /
• v.9 no.7
• /
• pp.2599-2613
• /
• 2015

Multi-index hashing (MIH) is the state-of-the-art method for indexing binary codes, as it di-vides long codes into substrings and builds multiple hash tables. However, MIH is based on the dataset codes uniform distribution assumption, and will lose efficiency in dealing with non-uniformly distributed codes. Besides, there are lots of results sharing the same Hamming distance to a query, which makes the distance measure ambiguous. In this paper, we propose a data-oriented multi-index hashing method (DOMIH). We first compute the covariance ma-trix of bits and learn adaptive projection vector for each binary substring. Instead of using substrings as direct indices into hash tables, we project them with corresponding projection vectors to generate new indices. With adaptive projection, the indices in each hash table are near uniformly distributed. Then with covariance matrix, we propose a ranking method for the binary codes. By assigning different bit-level weights to different bits, the returned bina-ry codes are ranked at a finer-grained binary code level. Experiments conducted on reference large scale datasets show that compared to MIH the time performance of DOMIH can be improved by 36.9%-87.4%, and the search accuracy can be improved by 22.2%. To pinpoint the potential of DOMIH, we further use near-duplicate image retrieval as examples to show the applications and the good performance of our method.

• The Journal of Korean Institute of Communications and Information Sciences
• /
• v.39A no.3
• /
• pp.127-139
• /
• 2014

In this paper, we present two signal processing techniques for designing binary error correction codes for Multi-Level Cell(MLC) NAND flash memory. MLC NAND flash memory saves the non-binary symbol at each cell and shows asymmetric channel LLR l-density which makes it difficult to design soft-decision binary error correction codes such as LDPC codes and Polar codes. Therefore, we apply density mirroring and EM algorithm for approximating the MLC NAND flash memory channel to the binary-input memoryless channel. The density mirroring processes channel LLRs to satisfy roughly all-zero codeword assumption, and then EM algorithm is applied to l-density after density mirroring for approximating it to mixture of symmetric Gaussian densities. These two signal processing techniques make it possible to use conventional code design algorithms, such as density evolution and EXIT chart, for MLC NAND flash memory channel.

• Korean Journal of Optics and Photonics
• /
• v.17 no.5
• /
• pp.401-411
• /
• 2006

We propose an optical encryption/decryption technique for a security system based on 2-step phase-shifting digital holography. Phase-shilling digital holography is used for recording phase and amplitude information on a CCD device. 2-step phase-shifting is implemented by moving the PZT mirror with phase step of 0 or ${\pi}/2$. The binary data and the key are expressed with random code and random phase patterns. The digital hologram is a Fourier transform hologram and is recorded on CCD with 256 gray level quantization. We remove the DC term of the digital hologram fur data reconstruction, which is essential to reconstruct the original binary input data/image. The error evaluation fer the decrypted binary data is analyzed. One of errors is a quantization error in detecting the hologram intensity on CCD, and the other is generated from decrypting the data with the incorrect key. The technique using 2-step phase-shifting holography is more efficient than a 4-step method because 2-step phase-shifting holography system uses less data than the 4-step method for data storage or transmission. The simulation shows that the proposed technique gives good results fur the optical encryption of binary information.

• Proceedings of the Korean Institute of Information and Commucation Sciences Conference
• /
• 2012.05a
• /
• pp.237-240
• /
• 2012

Binary sequences of period $N=2^k-1$ are widely used in many areas of engineering and sciences. Some well-known applications include code-division multiple-access (CDMA) communications and stream cipher systems. In this paper, we analyze the equation $(x+1)^d=x^d+1$ over finite fields. The $d$ of the equation is used to analyze cross-correlation of binary sequences.