• Journal of The Korean Society of Clinical Toxicology
• /
• v.15 no.1
• /
• pp.24-30
• /
• 2017

Purpose: This study was conducted to investigate the frequency and clinical characteristics of anaphylaxis patients who are registered inaccurately with other disease codes. Methods: Study subjects presenting at the emergency department (ED) were retrospectively collected using disease codes to search for anaphylaxis patients in a previous studies. The study group was divided into an accurate and inaccurate group according to whether disease codes were accurately registered as anaphylaxis codes. Results: Among 266 anaphylaxis patients, 144 patients (54%) received inaccurate codes. Cancer was the most common comorbidity, and the radio-contrast media was the most common cause of anaphylaxis in the accurate group. Cutaneous and respiratory symptoms manifested more frequently in the inaccurate group, while cardiovascular and neurological symptoms were more frequent in the accurate group. Blood pressure was lower, and shock and non-alert consciousness were more common in the accurate group. Administration of intravenous fluid and epinephrine use were more frequent in the accurate group. Anaphylaxis patients with a history of cancer, shock, and epinephrine use were more likely to be registered as anaphylaxis codes accurately, but patients with respiratory symptoms were more likely to be registered with other disease codes. Conclusion: In cases of anaphylaxis, the frequency of inaccurately registered disease codes was higher than that of accurately registered codes. Anaphylaxis patients who were not treated with epinephrine at the ED who did not have a history of cancer, but had respiratory symptoms were at increased risk of being registered with disease codes other than anaphylaxis codes.

• Journal of the Korean Mathematical Society
• /
• v.39 no.2
• /
• pp.289-317
• /
• 2002

We associate binary codes to polynomials over fields of characteristic two and show that the binary Golay codes are associated to the Mathieu group polynomials in characteristics two. We give two more polynomials whose Galois group in $M_{12}$ but different self-orthogonal binary codes are associated. Also, we find a family of $M_{24}$-coverings which includes previous ones.

• Journal of applied mathematics & informatics
• /
• v.5 no.1
• /
• pp.99-110
• /
• 1998

In this paper we study cyclic codes in $Z_m$. i.e., ideals in $Z_mG$, G afinite abelian group and we give a classification of such codes. We also sgtudy the minimum Hamming distance and the generalized Hamming weight of BCH codes over $Z_m$.

• Bulletin of the Korean Mathematical Society
• /
• v.60 no.3
• /
• pp.829-844
• /
• 2023

In this paper, we present a new construction for self-dual codes that uses the concept of double bordered construction, group rings, and reverse circulant matrices. Using groups of orders 2, 3, 4, and 5, and by applying the construction over the binary field and the ring F₂ + uF₂, we obtain extremal binary self-dual codes of various lengths: 12, 16, 20, 24, 32, 40, and 48. In particular, we show the significance of this new construction by constructing the unique Extended Binary Golay Code [24, 12, 8] and the unique Extended Quadratic Residue [48, 24, 12] Type II linear block code. Moreover, we strengthen the existing relationship between units and non-units with the self-dual codes presented in [10] by limiting the conditions given in the corollary. Additionally, we establish a relationship between idempotent and self-dual codes, which is done for the first time in the literature.

• Bulletin of the Korean Mathematical Society
• /
• v.55 no.2
• /
• pp.341-357
• /
• 2018

We examine various dualities over the fields of even orders, giving new dualities for additive codes. We relate the MacWilliams relations and the duals of ${\mathbb{F}}_{2^{2s}}$ codes for these various dualities. We study self-dual codes with respect to these dualities and prove that any subgroup of order $2^s$ of the additive group is a self-dual code with respect to some duality.

• International conference on construction engineering and project management
• /
• 2009.05a
• /
• pp.316-322
• /
• 2009

The more repetitive, complex and objective the work, the more effective automation is. Code checking is an example of this. Checking building codes through a thick set of drawings is error-prone and time-consuming. In order to overcome this problem, several organizations have initiated efforts to automate building-code checking. Initiated study mainly focused on checking codes for invalidation, required size and crash, and then area of checkable codes have been expanding. But, it has not been considered for codes regarding anti-disaster/egress, which is also issued these days. This study is about how to automatically check codes for anti-disaster and egress based on Korea building codes. The codes can be categorized as five sections: egress way, material/capability, principals of evacuation, evacuation stairway and fire protection partition. To check automatically, there are problems, such as expression of codes for egress and limitation of extractable information from the BIM model. This paper shows what problems exist and assignments to be resolved. Also, current developing processes are presented, and suggestions are made about the direction for the work that remains.

• Journal of Korean Biological Nursing Science
• /
• v.26 no.1
• /
• pp.16-25
• /
• 2024

Purpose: This study aimed to investigate the effect of a video-based enteral nutrition education program using QR codes on the perception, knowledge, and performance of enteral nutrition for intensive care unit (ICU) nurses. Methods: This was a quasi-experimental study with a nonequivalent control group pre- and post-test design. The participants were nurses working at six ICUs within a single university hospital, with 55 nurses in the experimental group and 55 nurses in the control group. The video-based enteral nutrition education program using QR codes was repeated three times to the experimental group. Results: There was a statistically significant pre-post difference in perceptions between the two groups (Z = -4.04, p < .001) with 2.00 points (± 5.57) for the control group and 7.89 points (± 7.95) for the experimental group, in knowledge (Z = -7.48, p < .001) with 0.02 points (± 1.91) for the control and 4.18 points (± 2.33) for the experimental, and in performance (Z = -2.20, p = .028) with 0.06 points (± 3.96) for the control and 2.00 points (± 5.14) for the experimental. Conclusion: The video-based enteral nutrition education program using QR codes was effective in improving the perceptions, knowledge, and performance of enteral nutrition among ICU nurses. This enteral nutrition education program using QR codes in clinical education can contribute to evidence-based nursing practice by improving perceptions and knowledge of enteral nutrition.

• Journal of the Korean Mathematical Society
• /
• v.46 no.1
• /
• pp.13-30
• /
• 2009

A subset of n tuples of elements of ${\mathbb{Z}}_9$ is said to be a code over ${\mathbb{Z}}_9$ if it is a ${\mathbb{Z}}_9$-module. In this paper we consider an special family of cyclic codes over ${\mathbb{Z}}_9$, namely quadratic residue codes. We define these codes in term of their idempotent generators and show that these codes also have many good properties which are analogous in many respects to properties of quadratic residue codes over finite fields.

• Korean Journal of Mathematics
• /
• v.22 no.4
• /
• pp.725-742
• /
• 2014

In this paper, we find all inequivalent classes of self-orthogonal codes over $Z_{p^2}$ of lengths $l{\leq}3$ for all primes p, using similar method as in [3]. We find that the classification of self-orthogonal codes over $Z_{p^2}$ includes the classification of all codes over $Z_p$. Consequently, we classify all the codes over $Z_p$ and self-orthogonal codes over $Z_{p^2}$ of lengths $l{\leq}3$ according to the automorphism group of each code.

• Bulletin of the Korean Mathematical Society
• /
• v.55 no.5
• /
• pp.1371-1387
• /
• 2018

The classification of the self-dual codes over Galois rings GR(p, 2) and $GR(p^2,2)$ of length 4 is completed for all primes p up to equivalence in terms of automorphism group. We obtain all inequivalent classes and the number of each classes of self-dual codes for all primes.