• Title/Summary/Keyword: Galois Field

Search Result 108, Processing Time 0.024 seconds

GALOIS ACTIONS OF A CLASS INVARIANT OVER QUADRATIC NUMBER FIELDS WITH DISCRIMINANT D ≡ -3 (mod 36)

  • Jeon, Daeyeol
    • Journal of the Chungcheong Mathematical Society
    • /
    • v.23 no.4
    • /
    • pp.853-860
    • /
    • 2010
  • A class invariant is the value of a modular function that generates a ring class field of an imaginary quadratic number field such as the singular moduli of level 1. In this paper, using Shimura Reciprocity Law, we compute the Galois actions of a class invariant from a generalized Weber function $g_2$ over quadratic number fields with discriminant $D{\equiv}-3$ (mod 36).

Triple Error Correcting Reed Solomon Decoder Design Using Galois Subfield Inverse Calculator And Table ROM

  • An Hyeong-Keon;Hong Young-Jin
    • 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.

QUADRATIC RESIDUE CODES OVER GALOIS RINGS

  • Park, Young Ho
    • 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.

Low Complexity Systolic Montgomery Multiplication over Finite Fields GF(2m) (유한체상의 낮은 복잡도를 갖는 시스톨릭 몽고메리 곱셈)

  • Lee, Keonjik
    • Journal of Korea Society of Digital Industry and Information Management
    • /
    • v.18 no.1
    • /
    • pp.1-9
    • /
    • 2022
  • Galois field arithmetic is important in error correcting codes and public-key cryptography schemes. Hardware realization of these schemes requires an efficient implementation of Galois field arithmetic operations. Multiplication is the main finite field operation and designing efficient multiplier can clearly affect the performance of compute-intensive applications. Diverse algorithms and hardware architectures are presented in the literature for hardware realization of Galois field multiplication to acquire a reduction in time and area. This paper presents a low complexity semi-systolic multiplier to facilitate parallel processing by partitioning Montgomery modular multiplication (MMM) into two independent and identical units and two-level systolic computation scheme. Analytical results indicate that the proposed multiplier achieves lower area-time (AT) complexity compared to related multipliers. Moreover, the proposed method has regularity, concurrency, and modularity, and thus is well suited for VLSI implementation. It can be applied as a core circuit for multiplication and division/exponentiation.

NUMBER OF WEAK GALOIS-WEIERSTRASS POINTS WITH WEIERSTRASS SEMIGROUPS GENERATED BY TWO ELEMENTS

  • Komeda, Jiryo;Takahashi, Takeshi
    • Journal of the Korean Mathematical Society
    • /
    • v.56 no.6
    • /
    • pp.1463-1474
    • /
    • 2019
  • Let C be a nonsingular projective curve of genus ${\geq}2$ over an algebraically closed field of characteristic 0. For a point P in C, the Weierstrass semigroup H(P) is defined as the set of non-negative integers n for which there exists a rational function f on C such that the order of the pole of f at P is equal to n, and f is regular away from P. A point P in C is referred to as a weak Galois-Weierstrass point if P is a Weierstrass point and there exists a Galois morphism ${\varphi}:C{\rightarrow}{\mathbb{p}}^1$ such that P is a total ramification point of ${\varphi}$. In this paper, we investigate the number of weak Galois-Weierstrass points of which the Weierstrass semigroups are generated by two positive integers.

COMPOSITION OF POLYNOMIALS OVER A FIELD

  • Choi, EunMi
    • Journal of the Chungcheong Mathematical Society
    • /
    • v.22 no.3
    • /
    • pp.497-506
    • /
    • 2009
  • This work studies about the composition polynomial f(g(x)) that preserves certain properties of f(x) and g(x). We shall investigate necessary and sufficient conditions of f(x) and g(x) to be f(g(x)) is separable, solvable by radical or split completely. And we find relationship of Galois groups of f(g(x)), f(x) and of g(x).

  • PDF