• Journal of the Korea Institute of Information and Communication Engineering
• /
• v.26 no.3
• /
• pp.479-482
• /
• 2022

Recently, various artificial intelligence technologies are being applied to smart factory, finance, healthcare, and so on. When handling data requiring protection of privacy, distributed learning techniques are used. For distribution of information with privacy protection, encoding private information is required. Minimal codes has been used in such a secret-sharing scheme. In this paper, we explain the relationship between the characteristics of the minimal codes for application in distributed systems. We briefly deals with previously known construction methods, and presents extension methods for minimal codes. The new codes provide flexibility in distribution of private information. Furthermore, we discuss application scenarios for the extended codes.

• Journal of the Chungcheong Mathematical Society
• /
• v.33 no.1
• /
• pp.43-56
• /
• 2020

Recently, linear codes constructed from defining sets have been studied widely and determined their complete weight enumerators and weight enumerators. In this paper, we obtain complete weight enumerators of linear codes and weight enumerators of linear codes. These codes have at most three weight linear codes. As application, we show that these codes can be used in secret sharing schemes and authentication codes.

• Bulletin of the Korean Mathematical Society
• /
• v.57 no.1
• /
• pp.37-50
• /
• 2020

Linear complementary dual (LCD) codes are linear codes that intersect with their dual trivially. LCD cyclic codes have been known as reversible cyclic codes that had applications in data storage. Due to a newly discovered application in cryptography, interest in LCD codes has increased again. Although LCD codes over finite fields have been extensively studied so far, little work has been done on LCD codes over chain rings. In this paper, we are interested in structure of LCD codes over chain rings. We show that LCD codes over chain rings are free codes. We provide some necessary and sufficient conditions for an LCD code C over finite chain rings in terms of projections of linear codes. We also showed the existence of asymptotically good LCD codes over finite chain rings.

• Journal of the Korean Institute of Telematics and Electronics
• /
• v.12 no.1
• /
• pp.7-11
• /
• 1975

Investigations on sole characteristics of unit-distance duo-decimal codes are carried out, and 31kinds of Prime Digit Sequence (PDS) are proposed in order to express various digit sequences. From these PDS, by means of the rotational conversion, 348 digit sequences which express the practical GC are obtained, and, ism these digit sequences, it is found that there are 120576 unit distance codes by the permutation of the coordinate number and the initial condition of the codes. Some special codes such as reflected or symmetrical codes and Lippel codes, and their application to the practical GC counter are also studied.

• Journal of Communications and Networks
• /
• v.15 no.2
• /
• pp.217-221
• /
• 2013

Quantum low-density parity-check (LDPC) codes based on the Calderbank-Shor-Steane construction have low encoding and decoding complexity. The sum-product algorithm(SPA) can be used to decode quantum LDPC codes; however, the decoding performance may be significantly decreased by the many four-cycles required by this type of quantum codes. All four-cycles can be eliminated using the entanglement-assisted formalism with maximally entangled states (ebits). The proposed entanglement-assisted quantum error-correcting code based on Euclidean geometry outperform differently structured quantum codes. However, the large number of ebits required to construct the entanglement-assisted formalism is a substantial obstacle to practical application. In this paper, we propose a novel class of entanglement-assisted quantum LDPC codes constructed using classical Euclidean geometry LDPC codes. Notably, the new codes require one copy of the ebit. Furthermore, we propose a construction scheme for a corresponding zigzag matrix and show that the algebraic structure of the codes could easily be expanded. A large class of quantum codes with various code lengths and code rates can be constructed. Our methods significantly improve the possibility of practical implementation of quantum error-correcting codes. Simulation results show that the entanglement-assisted quantum LDPC codes described in this study perform very well over a depolarizing channel with iterative decoding based on the SPA and that these codes outperform other quantum codes based on Euclidean geometries.

• Bulletin of the Korean Mathematical Society
• /
• v.55 no.3
• /
• pp.921-935
• /
• 2018

In this study we determine the structure of m-adic residue codes over the non-chain ring $F_q[v]/(v^2-v)$ and present some promising examples of such codes that have optimal parameters with respect to Griesmer Bound. Further, we show that the generators of m-adic residue codes serve as a natural and suitable application for generating reversible DNA codes via a special automorphism and sets over $F_{4^{2k}}[v]/(v^2-v)$.

• Journal of Broadcast Engineering
• /
• v.16 no.6
• /
• pp.1026-1035
• /
• 2011

This paper presents generalization and application for the conventional SISO decoding algorithm of Block Turbo Codes. R. M. Pyndiah suggested an iterative SISO decoding algorithm for Product Codes, two-dimensionally combined linear block codes, on AWGN channel. It wascalled Block Turbo Codes. Based on decision of Chase algorithm which is SIHO decoding method, SISO decoder for BTC computes soft decision information and transfers the information to next decoder for iterative decoding. Block Turbo Codes show Shannon limit approaching performance with a little iteration at high code rate on AWGN channel. In this paper we generalize the conventional decoding algorithm of Block Turbo Codes, under BPSK modulation and AWGN channel transmission assumption, to the LLR value based algorithm and suggest an application example such as concatenated structure of LDPC codes and Block Turbo Codes.

• Journal of the Korean Society of Propulsion Engineers
• /
• v.23 no.6
• /
• pp.59-71
• /
• 2019

The numerical analysis of ablative thermal protection systems (TPS) for solid rockets has been carried out with various in-house codes since the 1960s. However, the application scope of commercial codes has been expanded by adding subroutines and user-defined functions (UDF) to codes such as Fluent, Marc, and ABAQUS. In the past, the flow, thermal response and structural analysis of TPS have been performed using separate approaches. Recently, research has been conducted to interrelate them. In this paper, the thermal response characteristics of thermal protection materials, the in-house codes for thermal response analysis, and the research trends of flow-thermal-structure analysis of TPS using commercial codes were reviewed.

• Nuclear Engineering and Technology
• /
• v.54 no.7
• /
• pp.2395-2407
• /
• 2022

The sodium-cooled fast reactor is among the innovative nuclear technologies selected in the framework of the development of Generation IV concepts, allowing the irradiation of uranium-plutonium mixed oxide fuels (MOX). A fundamental step for the safety assessment of MOX-fuelled pins for fast reactor applications is the evaluation, by means of fuel performance codes, of the integral thermal-mechanical behaviour under irradiation, involving the fission gas behaviour and release in the fuel-cladding gap. This work is dedicated to the performance analysis of an inner-core fuel pin representative of the ASTRID sodium-cooled concept design, selected as case study for the benchmark between the GERMINAL and TRANSURANUS fuel performance codes. The focus is on fission gas-related mechanisms and integral outcomes as predicted by means of the SCIANTIX module (allowing the physics-based treatment of inert gas behaviour and release) coupled to both fuel performance codes. The benchmark activity involves the application of both GERMINAL and TRANSURANUS in their "pre-INSPYRE" versions, i.e., adopting the state-of-the-art recommended correlations available in the codes, compared with the "post-INSPYRE" code results, obtained by implementing novel models for MOX fuel properties and phenomena (SCIANTIX included) developed in the framework of the INSPYRE H2020 Project. The SCIANTIX modelling includes the consideration of burst releases of the fission gas stored at the grain boundaries occurring during power transients of shutdown and start-up, whose effect on a fast reactor fuel concept is analysed. A clear need to further extend and validate the SCIANTIX module for application to fast reactor MOX emerges from this work; nevertheless, the GERMINAL-TRANSURANUS benchmark on the ASTRID case study highlights the achieved code capabilities for fast reactor conditions and paves the way towards the proper application of fuel performance codes to safety evaluations on Generation IV reactor concepts.

• Journal of Satellite, Information and Communications
• /
• v.9 no.2
• /
• pp.45-51
• /
• 2014

Luby transform (LT) codes are a class of ratelss codes, and they have capability of generating infinite length of parities with a given information length. These rateless codes can be effectively utilized to provide broadcasting and multicasting services where each user is in a different channel condition. For this reason, there have been a number of researches on the application of rateless codes for satellite systems. In this paper, by considering the current research status on rateless codes, we present VHLD implementation results of LT codes, for future hardware implementation for satellite systems. The results demonstrated in this paper can be utilized as a basic information on efficient utilization of rateless codes in the future satellite systems.