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 189
- Downloads 0
ON RANK-ONE ? *-COMMUTING OPERATORS
Let ? be a non zero complex number. An operator A is a rank one ? *-commutes with B if AB - ? BA* has rank one. If, moreover, B is compact operator then A is called to belong to (H). In other words,(H) = fA 2...
Optimal Pricing Policies For Deteriorating items With Preservation Technology And Price Sensitive Demand
This paper considers the problem of determining the price, cycle time and preservation technology cost strategies for deteriorating items. It is assumed that preservation technology investment and demand rate do follow t...
STABILITY OF TREDECIC FUNCTIONAL EQUATION IN MATRIX NORMED SPACES
In this current work, we dene and nd the general solution of the tredecic functional equation. We also investigate and establish the generalized Ulam-Hyers stability of this functional equation in matrix normed spaces by...
On a two (nonlocal) point boundary value problem of arbitrary (fractional) orders integro-differential equation
Here we study the existence of solutions of the functional integral equation:  ...
PROPERTIES OF FUZZY DITANCE ON FUZZY SET
In this paper we introduce the definition of fuzzy distance space on fuzzy set then we study and discuss several properties of this space after some illustrative examples are given . Furthermore we introduce the de...