A way to compute a greatest common divisor in the Galois field (GF (2^n ))
Journal Title: JOURNAL OF ADVANCES IN MATHEMATICS - Year 2019, Vol 16, Issue 0
Abstract
This paper presents how the steps that used to determine a multiplicative inverse by method based on the Euclidean algorithm, can be used to find a greatest common divisor for polynomials in the Galois field (2^n ).
Authors and Affiliations
Waleed Eltayeb Ahmed
Keywords
Related Articles
- EP ID EP651876
- DOI 10.24297/jam.v16i0.8167
- Views 192
- Downloads 0
Research on the integration of mathematics history into the teaching of Higher Mathematics
This article researches the understanding and evaluation of tf mathematics history and its applying to the higher mathematics teaching, discusses the significance and role of history of mathematics in higher mathematics...
Approximation of General Form for a Sequence of Linear Positive Operators Based on Four Parameters
In the present paper, we define a generalization sequence of linear positive operators based on four parameters which is reduce to many other sequences of summation–integral older type operators of any weight function (B...
A probability space of continuous-time discrete value stochastic process with Markov property
Getting acquainted with the theory of stochastic processes we can read the following statement: "In the ordinary axiomatization of probability theory by means of measure theory, the problem is to construct a sigma-algebr...
Further Acceleration of the Simpson Method for Solving Nonlinear Equations
There are two aims of this paper, firstly, we present an improvement of the classical Simpson third-order method for finding zeros a nonlinear equation and secondly, we introduce a new formula for approximating second-or...
ARE THETA FUNCTIONS THE FOUNDATIONS OF PHYSICS ?
The Jacobi theta functions are essentially rotations in a complex space and as such provide a basis for the lattices of the exceptional Lie algebras E6;E8 in complex 3-space and complex 4-space.In this note we will...