• 한국정보통신학회논문지
• /
• 제26권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.

• 충청수학회지
• /
• 제33권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.

• 대한수학회보
• /
• 제57권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.

• 대한전자공학회논문지
• /
• 제12권1호
• /
• pp.7-11
• /
• 1975

12-Tuple DS (digit sequence) (또는 coordinate sequence)의 여러 가지 성질에 관하여 논하였으며 그것을 통일적으로 표시하기 위한 31종의 PDS(prime digit sequence)를 제안하여 이에 단순히 회전변환만을 실시함으로써 실제의 부호를 표시하는 348종의 DS를 얻을 수 있고 또 이것들에 대한번호교환 즉 순열(permutation)과 부호의 초기조건을 고려하면 단위거리 12진 부호의 총수는 120,576종이며 이 중의 임의의 부호를 지정하든지 기술하든지 할 수 있도록 하였다. 그리고 대칭부호(반대부호), Lippel 부호등 특수한 부호를 위한 DS들의 특성과 그것들이 회로화에 대하여도 언급하였다. 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
• /
• 제15권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.

• 대한수학회보
• /
• 제55권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)$.

• 방송공학회논문지
• /
• 제16권6호
• /
• pp.1026-1035
• /
• 2011

본 논문은 기존 블록 터보 부호의 SISO(Soft-input Soft-output) 기반 반복 복호 알고리즘의 일반화 및 활용에 대한 연구를 다루고 있다. R. M. Pyndiah는 AWGN 채널(Additive White Gaussian Noise Channel)에서 2차원 Linear Block Code(선형 블록 부호, LBC) 결합으로 구성된 Product 부호의 SISO 반복 복호 방식을 제안했으며, 이를 블록 터보 부호라 하였다. 블록 터보 부호의 SISO 복호방식은 SIHO(Soft-input Hard-output) 복호 방식인 Chase 알고리즘의 부호 판정을 기반으로 연판정 정보를 생성 후 전달하여 반복적인 복호를 수행한다. 블록 터보 부호는 AWGN 채널에서 높은 Code-rate(부호율)의 Product 부호에 대해 적은 SISO 복호 반복만으로도 샤논 한계에 근접하는 우수한 성능을 보여준다. 본 논문에서는 BPSK(Binary Phase Shift Keying) 변조와 AWGN 채널 전송을 가정한 기존 블록 터보 부호 복호 알고리즘을 채널 출력의 LLR(Log-likelihood Ratio)에 기반한 알고리즘으로 일반화하고, LDPC(Low-density Parity Check) 부호와 블록 터보 부호의 직렬 결합 구조에서 일반화된 알고리즘 활용 예를 제시한다.

• 한국추진공학회지
• /
• 제23권6호
• /
• pp.59-71
• /
• 2019

고체 로켓용 삭마성 내열 시스템의 수치 해석은 1960년대부터 다양한 In-house 코드로 수행되어 왔으나 Fluent, Marc, ABAQUS 등 상용코드에 서브루틴, UDF 등을 추가하여 해석 범위를 확장함으로써 상용코드의 활용 범위가 넓어지고 있다. 또한 예전에는 내열 시스템의 유동, 열반응과 구조해석을 각각 수행하였으나 근래에는 이들을 서로 연동하여 해석하는 연구들이 진행되고 있다. 본 논문에서는 내열재의 열반응 특성, 열반응 해석용 In-house 코드 그리고 상용코드로 내열 시스템의 유동, 열반응과 구조 해석을 수행한 연구동향을 고찰하였다.

• Nuclear Engineering and Technology
• /
• 제54권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.

• 한국위성정보통신학회논문지
• /
• 제9권2호
• /
• pp.45-51
• /
• 2014

Luby transform (LT) 부호는 무율(rateless) 부호의 하나로써, 주어진 정보 길이에 대해 이론적으로 무한대의 부호어를 생성해 낼 수 있도록 설계된 부호이다. 이와 같은 무율부호는 방송 및 멀티캐스팅 서비스에서 수신자 별로 서로 다른 채널의 상황에 대비하여 사용될 수 있다는 점에서 효과적인 방식이다. 위성 시스템에서도 이와 같은 무율부호를 적용하는 여러 가지 경우에 대하여 연구가 진행 중이다. 본 논문에서는 이와 같은 연구 추세를 감안하여 무율부호 중 가장 먼저 개발된 LT 부호에 대한 하드웨어 구현을 위하여, VHDL을 이용하여 LT 부호의 구현 결과를 소개한다. 본 논문에서 제시된 결과는 향후 위성 시스템에서 무율 부호가 효과적으로 활용될 수 있는 기초적인 자료로 활용될 것이다.