• Proceedings of the Korean Society of Broadcast Engineers Conference
• /
• 2012.11a
• /
• pp.64-66
• /
• 2012

본 논문에서는 각기 다른 자료를 지닌 두 송신자가 하나의 수신자에게 릴레이를 거쳐 자료를 전송하는 Ynetwork 시스템에서 Polar code 의 구조적인 특징을 이용해 오류율을 줄여 전송할 수 있는 방법을 제안한다. Polar code 는 부호의 길이 N 이 커짐에 따라 임의의 B-DMC(Binary-Discrete Memoryless Channel)에 대해 채널 용량을 달성할 수 있는 부호이며 반복적인 구조로 인해 부호화와 복호화 복잡도가 낮은 장점을 가진 부호이다. 이러한 성질을 이용해 Y-network 시스템의 릴레이에서 간단한 이진 모듈로 덧셈으로 전체 부호의 길이를 늘려 전송효율을 높일 수 있다.

• The Transactions of The Korean Institute of Electrical Engineers
• /
• v.62 no.1
• /
• pp.127-132
• /
• 2013

In this paper, we design the physical layer of Guardian modem for wireless public networks. The physical layer is composed of a dual-band RF (Radio Frequency) transceiver and a baseband-processor with quasi-orthogonal codes. The 2.4/5GHz dual-band RF transceiver can overcome the communication difficulty of dense 2.4GHz band for wireless public environment. Also the quasi-orthogonal code can reduce the required ASIC (Application Specific Integrated Circuit) design area. Finally, we analyze the performance of the developed system in viewpoint of data rate, BER (Bit Error Rate), PER (Packet Error Rate). Moreover we verify the performance of the dual-band RF communication.

• Journal of the Korea Academia-Industrial cooperation Society
• /
• v.5 no.5
• /
• pp.409-412
• /
• 2004

This paper shows that the proposed Turbo TCM(Turbo Trellis Coded Modulation) has a good performance with a little complexity of decoder. The encoder structure, which is connected with Turbo Codes, is the proposed modulation technique for an efficient bandwidth, This method is used symbol by symbol MAP decoder of iteration similar to binary Turbo Codes in the receiver. The result shows that the BER performance according to iteration is improved about 2,5dB at $BER=10^{-2}$ compared to Turbo Codes with Gray mapping.

• Journal of the Korea Institute of Information Security & Cryptology
• /
• v.12 no.1
• /
• pp.43-54
• /
• 2002

McEliece introduced a public-key cryptosystem based on Algebraic codes, specially binary classical Goppa which have a good decoding algorithm and vast number of inequivalent codes with given parameters. And the advantage of this system low cost of their encryption and decryption procedures compared with other public-key systems specially RSA, ECC based on DLP(discrete logarithm problem). But in [1], they resent new attack based on probabilistic algorithm to find minimum weight codeword, so for a sufficient security level, much larger parameter size [2048, 1608,81]is required. Then the big size of public key make McEliece PKC more inefficient. So in this paper, we will propose New Type PKC using q-ary Hyperelliptic code so that with smaller parameter(1 over 3) but still work factor as hi인 as McEliece PKC and faster encryption, decryption can be maintained.

• Journal of the Korean Institute of Telematics and Electronics
• /
• v.23 no.3
• /
• pp.295-308
• /
• 1986

This paper presents a method of constructing multiple-valued logic functions based on Galois field. The proposed algorithm assigns all elements in GF(2**m) to bit codes that are easily converted binary. We have constructed an adder and a multiplier using a multiplexer after bit code operation (addition, multiplication) that is performed among elements on GF(2**m) obtained from the algorithm. In constructing a generalized multiple-valued logic functions, states are first minimized with a state-transition diagram, and then the circuits using PLA widely used in VLSI design for single and multiple input-output are realized.

• Journal of the Korea Convergence Society
• /
• v.4 no.3
• /
• pp.27-33
• /
• 2013

Conventional bar code has the appearance of line bars and spaces, called as one-dimensional bar code. In contrast, the information in two-dimensional bar code is represented by either a small, rectangular or square with the types of mosaic and Braille. The two-dimensional bar code is much more efficient than one-dimensional bar code because it can allow to store and express large amounts of data in a small space and so far there is also a little information about decoding the Data Matrix in base 256 mode. According to the ISO international standards, there are four kinds of bar code: QR code, Data Matrix, PDF417, and Maxi code. In this paper, among them, we focus on describing the basic concepts of Data Matrix in base 256 mode, how to encode and decode them, and how to organize them in detail. In addition, Data Matrix can be organized efficiently depending on the modes of numeric, alphanumeric characters, and binary system and expecially, we focus on describing how to decode the Data Matrix code by four modes.

• The Journal of Korean Institute of Communications and Information Sciences
• /
• v.24 no.12A
• /
• pp.1939-1947
• /
• 1999

This paper proposes new line code BIM (Bit Insertion and Manipulation) that is designed to overcome the problems of existing line codes. The block code, one of typical existing line code, has good transmission performance but difficulty in implementation. The other typical existing line code, bit insertion code, is easy to implementation but has bad transmission performance. BIM code in this paper could provide not only good performance but also provides simplicity in the implementation by combining the good points of block code into it of bit insertion code properly. In this paper, 5B6B type BIM code is designed. Designed 5B6B BIM code shows good transmission performance such $\pm$2 DSV, 0 RSD, 7 maximum run length and also it can be implemented under 2000 gates and need only 1 bit redundancy.

• Journal of the Korea Institute of Information and Communication Engineering
• /
• v.10 no.8
• /
• pp.1478-1489
• /
• 2006

This paper describes system to extract ISO codes in container image. A container ISO code recognition system for real-time processing is made of 5 core parts which are container ISO code detection and image acquisition, ISO code region extraction, individual character extraction, character recognition and database. Among them, the accuracy of ISO code extraction can affect significantly the accuracy of system recognition rate, and also the more exact extraction of ISO code is required in various weather and environment conditions. The proposed system produces binary of the ISO code's template lesions using an adaptive thresholding, extracts candidate regions containing distribution of ISO code, and recognizes ISO codes as detecting a final region through the verifications by using character distribution characteristics of ISO code among the extracted candidates. Experimental results reveal that ISO codes can be efficiently extracted by the proposed method.

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