• Journal of the Institute of Electronics Engineers of Korea SC
• /
• v.47 no.1
• /
• pp.42-46
• /
• 2010

Encapsulation for information security is often carried out in Galois field in the form of arithmetic operations. This paper proposes how to efficiently perform exponentiation of arithmetic information on Galois field. Especially, by improving an existing bit-parallel exponentiator to exclude elements with heavy gate counts and to take advantage of system constants, this paper proposes how to implement a VLSI architecture with high performance even for large m.

• Communications of the Korean Mathematical Society
• /
• v.20 no.4
• /
• pp.641-644
• /
• 2005

Let L/F be a Galois quadratic extension such that F contains a primitive n-th root of 1. Let N = L(${\alpha}^{{\frac{1}{n}}$) where ${\alpha}{\in}L{\ast}$. We show that if $N_{L/F}({\alpha})\;{\in}L^n{\cap}F$, and [N : L] = m, then $G(N/ F) {\simeq}D_m$ or generalized quaternion group whether $N_{L/F}({\alpha})\;{\in}\;F^n\;or\;{\notin}F^n$, respectively.

• The Journal of Korean Institute of Communications and Information Sciences
• /
• v.31 no.1C
• /
• pp.8-13
• /
• 2006

A new RS(Reed Solomon) Decoder design method, using Galois Subfield GF($2^4$) Multiplier, is described. The Decoder is designed using Normalized error position stored ROM. Here New Inverse Calculator in GF($2^8$) is designed, which is simpler and faster than the classical GF($2^8$) direct inverse calculator, using the Galois Subfield GF($2^4$) Arithmatic operator.

• Korean Journal of Mathematics
• /
• v.24 no.3
• /
• pp.567-572
• /
• 2016

Quadratic residue codes are cyclic codes of prime length n defined over a finite field ${\mathbb{F}}_{p^e}$, where $p^e$ is a quadratic residue mod n. They comprise a very important family of codes. In this article we introduce the generalization of quadratic residue codes defined over Galois rings using the Galois theory.

• Journal of applied mathematics & informatics
• /
• v.18 no.1_2
• /
• pp.657-663
• /
• 2005

In this paper, we consider groups of permutations S on a set A acting on subsets X of A. In particular, we show that if $X_2{\subseteq}X_1{\subseteq}A$ and Y is an S-normal extension of $X_2 in X_1$, then the Galois group $G_{S}(X_1/Y){\;}of{\;}X_1{\;}over{\;}X_2$ relative to S is an S-closed subgroup of $G_{S}(X_1/X_2)$ in the setting of a Galois theory (correspondence) for this situation.

• Journal of the Chungcheong Mathematical Society
• /
• v.32 no.2
• /
• pp.171-177
• /
• 2019

We associate a positive integer n and a subgroup H of the group G(n) with a polynomial $J_{n,H}(x)$, which is called the Galois polynomial. It turns out that $J_{n,H}(x)$ is a polynomial with integer coefficients for any n and H. In this paper, we provide an equivalent condition for a subgroup H to provide the Galois polynomial which is irreducible over ${\mathbb{Q}}$.

• Journal of Applied and Pure Mathematics
• /
• v.4 no.3_4
• /
• pp.211-219
• /
• 2022

We study MDS(maximum distance separable) self-dual codes over Galois ring R = GR(2^m, r). We prove that there exists an MDS self-dual code over R of length n if (n - 1) divides (2^r - 1), and 2^m divides n. We also provide the current state of the problem for the existence of MDS self-dual codes over Galois rings.

• The Transactions of the Korea Information Processing Society
• /
• v.2 no.4
• /
• pp.477-486
• /
• 1995

This paper describes and constructs object-oriented analysis models using Galois-lattices that we are always studying in discrete mathematics, shows fundamental approaches to maintain the models, analyzes the construction of object-oriented analysis models through good examples. Also, we define several properties of Galois-lattices that have binary relations between class objects, propose the incremental updating algorithms that can update the Galois-lattice whenever new classes are added. This proposal shows that in case of adding new class nodes the results from simulations can implement in constant time and have linearly the incremental structures in worst cases, and in that the growth rate of lattices is proportioned to class nodes in time complexity. This results can achieve the high understandability of object-oriented analysis models and the high traceability of maintenance models. Furthermore it is possible to make more efficient performances of class reusability in advantages of object-oriented systems and support truly the class hierarchical maintenances.

• Korean Journal of Mathematics
• /
• v.27 no.4
• /
• pp.1109-1118
• /
• 2019

In this paper, we introduce the notion of residuated and Galois connections on adjoint triples and investigate their properties. Using the properties of residuated and Galois connections, we solve fuzzy relation equations and give their examples.

• The Pure and Applied Mathematics
• /
• v.23 no.1
• /
• pp.53-59
• /
• 2016

Let G be a finite group containing a non-abelian Sylow 2-subgroup. We elementarily show that every G-Galois field extension L/K has a hyperbolic trace form in the presence of root of unity.