• Proceedings of the Korean Institute of Communication Sciences Conference
• /
• 1986.04a
• /
• pp.1-3
• /
• 1986

We are concerned with transmitting numerical source data of {0, 1, 2, ..., 2k-1} through a channel coding system. The rate 1/v dual-k convolutional code with the orthogonal MFSK modulation and the Viterbl decoding is employed for the implementation of the channel coding system. The mean square error of the dual-k convolutional code is evaluated for the numerical source transmitted over an additive white Gaussian noise channel with Rayleigh fading.

• Proceedings of the KSME Conference
• /
• 2004.11a
• /
• pp.55-60
• /
• 2004

This study is concerned to the perforation phenomena of the oblique dual-plate by projectile. Experiment and simulation related to that was carried out. the variables considered in this phenomena include the electrolytic zinc coated steel sheet and carbon steel rod. In the former, the confirmation and projectile velocity possible phenomena of real phenomena is done, the latter, the effect of parameter such as time-step and grid space length is analized by using the three-dimensional Lagrangian explicit time-integration finite element code, HEMP. this code use the eight node hexahedral elements and in this study, Von-Mises Criteria is used as the strength model, Mie-Gruneisen is as the Equation of State. the simulation was performed by contrast with the experiment. through the calibration of the parameter of lagrangian code, reasonable result was approached.

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

• Journal of Institute of Control, Robotics and Systems
• /
• v.14 no.1
• /
• pp.7-12
• /
• 2008

A GNSS(Global Navigation Satellite System) using GPS provides us with very useful information concerning the positioning of users in many sectors such as transportation, social services, the justice system and customs services, public works, search and rescue systems and leisure. A GNSS using the Galileo satellite is due to work in 2008 and expected to be used in various fields such as aviation, marine transportation, land surveying, resources development precise agriculture, telemetics, and so on. In this paper, we discuss the implementation and testing of a combined GPS/Galileo receiver which we named KSTAR V1.0. Each tracking module of GPS/Galileo dual mode correlator has the five track arms which consist of Very Early code, Early code, Prompt code, late code, and Very late code. Each of 24 tracking modules can be assigned to GPS and/or Galileo signal by changing mode selection register. The basic correlator integration dump period is set to 1ms for GPS C/A code and fast Galileo signal tracking. The performance of the developed combined GPS/Galileo receiver was tested and evaluated using the IF (Intermediated Frequency)-level GPS/Galileo signal generator.

• Journal of Information Processing Systems
• /
• v.13 no.5
• /
• pp.1071-1088
• /
• 2017

For dual-hop multiple-input multiple-output (MIMO) decode-and-forward relaying systems, we propose a selective relaying scheme that uses orthogonal space-time block code (OSTBC) and transmit antenna selection with maximal-ratio combining (TAS/MRC) or vice versa at the first and second hops, respectively. The aim is to achieve an asymptotically identical performance to the dual-hop relaying system with only TAS/MRC, while requiring lower feedback overhead. In particular, we give the selection criteria based on the antenna configurations and the average channel powers for the first and second hops, assuming Rayleigh fading channels. Also, the numerical results are shown for the outage performance comparison between the dual-hop DF relaying systems with the proposed scheme, only TAS/MRC, and only OSTBC.

• Bulletin of the Korean Mathematical Society
• /
• v.49 no.1
• /
• pp.135-143
• /
• 2012

We present two kinds of construction methods for self-dual codes over $\mathbb{F}_2+u\mathbb{F}_2$. Specially, the second construction (respectively, the first one) preserves the types of codes, that is, the constructed codes from Type II (respectively, Type IV) is also Type II (respectively, Type IV). Every Type II (respectively, Type IV) code over $\mathbb{F}_2+u\mathbb{F}_2$ of free rank larger than three (respectively, one) can be obtained via the second construction (respectively, the first one). Using these constructions, we update the information on self-dual codes over $\mathbb{F}_2+u\mathbb{F}_2$ of length 9 and 10, in terms of the highest minimum (Hamming, Lee, or Euclidean) weight and the number of inequivalent codes with the highest minimum weight.

• Journal of applied mathematics & informatics
• /
• v.30 no.5_6
• /
• pp.821-827
• /
• 2012

In this paper, we prove that for all odd prime powers $q$ there exist MDS(maximum distance separable) self-dual codes over $\mathbb{F}_{q^2}$ for all even lengths up to $q+1$. Additionally, we prove that there exist MDS self-dual codes of length four over $\mathbb{F}_q$ for all $q$ > 2, $q{\neq}5$.

• Journal of Digital Contents Society
• /
• v.15 no.3
• /
• pp.347-355
• /
• 2014

The general octree structure is common for various applications including computer graphics, geometry information analysis and query. Unfortunately, the general octree approach causes duplicated sample data and discrepancy between sampling and representation positions when applied to sample continuous spatial information, for example, signed distance fields. To address these issues, some researchers introduced the dual octree. In this paper, the weakness of the dual octree approach will be illustrated by focusing on the fact that the dual octree cannot access some specific continuous zones asymptotically. This paper shows that the primal tree presented by Lefebvre and Hoppe can solve all the problems above. Also, this paper presents a three-dimensional primal tree traversal algorithm based the Morton codes which will help to parallelize the primal tree method.

• Journal of the Korean Society of Clothing and Textiles
• /
• v.38 no.6
• /
• pp.913-928
• /
• 2014

This study estimated a dual path model to predict consumers' intention to use a QR code virtual store by the effect of a mobile transaction system and a facilitating condition that also examined the role of experience and the use of an intention model in the context of a QR code virtual store. A longitudinal field study was conducted at selected QR code virtual stores. A questionnaire containing mobile transaction system, facilitating condition, performance expectancy, effort expectance, and intention to use was administered at two different points in time: Initial use (T1) and the second use after one month (T2). This study sampled 109 subjects who voluntarily participated in field studies twice at different time points (pooled sample=218). Participants were asked to visit at the QR code virtual store and undertake shopping tasks on their smartphones. The estimated dual path model showed that a mobile transaction system had a positive effect on performance expectancy, which influenced intention to use; however, facilitating condition had a positive effect on effort expectancy, but the effort expectance did not lead to intention to use. The effort expectance significantly also affected the performance expectance influencing intention to use QR code virtual stores. It was also found that use experience moderated the effect of mobile transaction systems on performance expectancy. The findings discussed a critical and success factor in consumer technology acceptance and use over time. A managerial implication was also discussed to capture potential users by emphasizing performance expectancy with the superiority of an innovative system or consumer facilitating condition as external resources in the introduction stage of new technology.

• Korean Journal of Mathematics
• /
• v.28 no.2
• /
• pp.285-294
• /
• 2020

We study the complementary information set codes (for short, CIS codes) over 𝔽₄. They are strongly connected to correlation-immune functions over 𝔽₄. Also the class of CIS codes includes the self-dual codes. We find a construction method of CIS codes over 𝔽₄ and a criterion for checking equivalence of CIS codes over 𝔽₄. We complete the classification of all inequivalent CIS codes of length up to 8 over 𝔽₄.