• Title/Summary/Keyword: K-Code

Search Result 8,835, Processing Time 0.028 seconds

Algorithm of Decoding the Data Codeword in Two-Dimensional QR Code (이차원 QR Code에서 데이터 코드워드의 디코딩 알고리즘)

  • Park, Kwang Wook;Lee, Jong Yun
    • Journal of the Korea Convergence Society
    • /
    • v.4 no.4
    • /
    • pp.21-29
    • /
    • 2013
  • Two-dimensional QR Code has improved greatly the limits on the capacity, size, direction of the one-dimensional bar code. And it has the capacity of compressing and storing the massive amount of data and is widely used in many applications. Recently, the two-dimensional QR Code has been spread rapidly because of introducing the smart phones and increasing the amount of using them. However, there is little documentations about decoding the QR Code in which can store the large amount of information. In this paper, therefore, we present specific processing procedures and algorithms on decoding the two-dimensional QR Code and then make us understand their decoding process by explaining some examples.

Two-Dimensional Symmetric Balance Incomplete Block Design Codes for Small Input Power (작은 입력신호를 위한 Two-Dimensional Symmetric Balance Incomplete Block Design Code)

  • Jhee, Yoon Kyoo
    • Journal of the Institute of Electronics and Information Engineers
    • /
    • v.50 no.5
    • /
    • pp.121-127
    • /
    • 2013
  • When input power is small, nonideal symmetric balance incomplete block design(BIBD) code design is effective in the spectral-amplitude-code(SAC) optical code-division multiple-access (OCDMA) system. But the number of simultaneous users is not sufficient. To overcome this property, we propose 2-D BIBD codes, where nonideal BIBD codes are used as spectral code and ideal BIBD codes are used as spatial codes. Analytical results show that the number of simultaneous users increases significantly.

Optimal Heterogeneous Distributed Storage Regenerating Code at Minimum Remote-Repair Bandwidth Regenerating Point

  • Xu, Jian;Cao, Yewen;Wang, Deqiang;Wu, Changlei;Yang, Guang
    • ETRI Journal
    • /
    • v.38 no.3
    • /
    • pp.529-539
    • /
    • 2016
  • Recently, a product-matrix (PM) framework was proposed to construct optimal regenerating codes for homogeneous distributed storage systems (DSSs). In this paper, we propose an extended PM (EPM) framework for coding of heterogeneous DSSs having different repair bandwidths but identical storage capacities. Based on the EPM framework, an explicit construction of minimum remote-repair bandwidth regenerating (MRBR) codes is presented for a specific heterogeneous DSS, where two geographically different datacenters with associated storage nodes are deployed. The data reconstruction and regeneration properties of the MRBR code are proved strictly. For the purpose of demonstration, an example implementation of MRBR code is provided. The presented MRBR code is the first optimal strict-regenerating code for heterogeneous DSSs. In addition, our proposed EPM framework can be applied to homogeneous systems also.

Converting Panax ginseng DNA and chemical fingerprints into two-dimensional barcode

  • Cai, Yong;Li, Peng;Li, Xi-Wen;Zhao, Jing;Chen, Hai;Yang, Qing;Hu, Hao
    • Journal of Ginseng Research
    • /
    • v.41 no.3
    • /
    • pp.339-346
    • /
    • 2017
  • Background: In this study, we investigated how to convert the Panax ginseng DNA sequence code and chemical fingerprints into a two-dimensional code. In order to improve the compression efficiency, GATC2Bytes and digital merger compression algorithms are proposed. Methods: HPLC chemical fingerprint data of 10 groups of P. ginseng from Northeast China and the internal transcribed spacer 2 (ITS2) sequence code as the DNA sequence code were ready for conversion. In order to convert such data into a two-dimensional code, the following six steps were performed: First, the chemical fingerprint characteristic data sets were obtained through the inflection filtering algorithm. Second, precompression processing of such data sets is undertaken. Third, precompression processing was undertaken with the P. ginseng DNA (ITS2) sequence codes. Fourth, the precompressed chemical fingerprint data and the DNA (ITS2) sequence code were combined in accordance with the set data format. Such combined data can be compressed by Zlib, an open source data compression algorithm. Finally, the compressed data generated a two-dimensional code called a quick response code (QR code). Results: Through the abovementioned converting process, it can be found that the number of bytes needed for storing P. ginseng chemical fingerprints and its DNA (ITS2) sequence code can be greatly reduced. After GTCA2Bytes algorithm processing, the ITS2 compression rate reaches 75% and the chemical fingerprint compression rate exceeds 99.65% via filtration and digital merger compression algorithm processing. Therefore, the overall compression ratio even exceeds 99.36%. The capacity of the formed QR code is around 0.5k, which can easily and successfully be read and identified by any smartphone. Conclusion: P. ginseng chemical fingerprints and its DNA (ITS2) sequence code can form a QR code after data processing, and therefore the QR code can be a perfect carrier of the authenticity and quality of P. ginseng information. This study provides a theoretical basis for the development of a quality traceability system of traditional Chinese medicine based on a two-dimensional code.

Tag-Identification Mechanism using Orthogonal Code in RFID System (RFID 시스템에서 Orthogonal Code를 사용한 태그 인식 메커니즘)

  • Kim, Sung-Jun;Jung, Young-Hwan;Ahn, Sun-Shin
    • 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를 줄이는 메커니즘을 제시한다.

  • PDF

A Case Study on Improving SW Quality through Software Visualization (소프트웨어 가시화를 통한 품질 개선 사례 연구)

  • Park, Bo Kyung;Kwon, Ha Eun;Son, Hyun Seung;Kim, Young Soo;Lee, Sang-Eun;Kim, R. Young Chul
    • Journal of KIISE
    • /
    • v.41 no.11
    • /
    • pp.935-942
    • /
    • 2014
  • Today, it is very important issue to high quality of software issue on huge scale of code and time-to-market. In the industrial fields still developers focuses on Code based development. Therefore we try to consider two points of views 1) improving the general developer the bad development habit, and 2) maintenance without design, documentation and code visualization. To solve these problems, we need to make the code visualization of code. In this paper, we suggest how to visualize the inner structure of code, and also how to proceed improvement of quality with constructing the Tool-Chain for visualizing Java code's inner structure. For our practical case, we applied Object Code with NIPA's SW Visualization, and then reduced code complexity through quantitatively analyzing and visualizing code based on setting the basic module unit, the class of object oriented code.

Toward the Development of a New MHD Code for Fusion Plasma

  • Jang, Hanbyul;Ryu, Dongsu
    • The Bulletin of The Korean Astronomical Society
    • /
    • v.40 no.2
    • /
    • pp.38.2-38.2
    • /
    • 2015
  • Development of a new code for magnetohydrodynamic (MHD) phenomena in fusion plasma is under progress through a collaboration between plasma physicists, mathematicians, and astrophysicists. The code employs approaches different from those of existing codes. For instance, it is based on a finite difference scheme of high-order and high accuracy, complying conservation laws. The new code will have characteristics distinguished from those of commonly used code such as M3D and NIMROD. Here we will report the progress of the code development.

  • PDF

THE t-WISE INTERSECTION OF RELATIVE THREE-WEIGHT CODES

  • Li, Xin;Liu, Zihui
    • Bulletin of the Korean Mathematical Society
    • /
    • v.54 no.4
    • /
    • pp.1095-1110
    • /
    • 2017
  • The t-wise intersection is a useful property of a linear code due to its many applications. Recently, the second author determined the t-wise intersection of a relative two-weight code. By using this result and generalizing the finite projective geometry method, we will present the t-wise intersection of a relative three-weight code and its applications in this paper.

A CONSTRUCTION OF TWO-WEIGHT CODES AND ITS APPLICATIONS

  • Cheon, Eun Ju;Kageyama, Yuuki;Kim, Seon Jeong;Lee, Namyong;Maruta, Tatsuya
    • Bulletin of the Korean Mathematical Society
    • /
    • v.54 no.3
    • /
    • pp.731-736
    • /
    • 2017
  • It is well-known that there exists a constant-weight $[s{\theta}_{k-1},k,sq^{k-1}]_q$ code for any positive integer s, which is an s-fold simplex code, where ${\theta}_j=(q^{j+1}-1)/(q-1)$. This gives an upper bound $n_q(k,sq^{k-1}+d){\leq}s{\theta}_{k-1}+n_q(k,d)$ for any positive integer d, where $n_q(k,d)$ is the minimum length n for which an $[n,k,d]_q$ code exists. We construct a two-weight $[s{\theta}_{k-1}+1,k,sq^{k-1}]_q$ code for $1{\leq}s{\leq}k-3$, which gives a better upper bound $n_q(k,sq^{k-1}+d){\leq}s{\theta}_{k-1}+1+n_q(k-1,d)$ for $1{\leq}d{\leq}q^s$. As another application, we prove that $n_q(5,d)={\sum_{i=0}^{4}}{\lceil}d/q^i{\rceil}$ for $q^4+1{\leq}d{\leq}q^4+q$ for any prime power q.

THE DEVELOPMENT AND ASSESSMENT STRATEGY OF A THERMAL HYDRAULICS COMPONENT ANALYSIS CODE (열수력 기기해석용 CUPID 코드 개발 및 평가 전략)

  • Park, I.K.;Cho, H.K.;Lee, J.R.;Kim, J.;Yoon, H.Y.;Lee, H.D.;Jeong, J.J.
    • Journal of computational fluids engineering
    • /
    • v.16 no.2
    • /
    • pp.30-48
    • /
    • 2011
  • A three-dimensional thermal-hydraulic code, CUPID, has been developed for the analysis of transient two-phase flows at component scale. The CUPID code adopts a two-fluid three-field model for two-phase flows. A semi-implicit two-step numerical method was developed to obtain numerical solutions on unstructured grids. This paper presents an overview of the CUPID code development and assessment strategy. The governing equations, physical models, numerical methods and their improvements, and the systematic verification and validation processes are discussed. The code couplings with a system code, MARS, and, a three-dimensional reactor kinetics code, MASTER, are also presented.