
Recurrent algorithm for calculation of value of formal derivative of polynomial over Galois field and its hardware implementation
Author(s) -
P A Rahman
Publication year - 2019
Publication title -
journal of physics. conference series
Language(s) - English
Resource type - Journals
SCImago Journal Rank - 0.21
H-Index - 85
eISSN - 1742-6596
pISSN - 1742-6588
DOI - 10.1088/1742-6596/1333/3/032067
Subject(s) - generic polynomial , galois theory , primitive polynomial , mathematics , gf(2) , algorithm , polynomial , derivative (finance) , field (mathematics) , computer science , discrete mathematics , finite field , pure mathematics , normal basis , splitting of prime ideals in galois extensions , mathematical analysis , financial economics , economics
Within the scope of this scientific paper the formal derivative of the polynomial over the Galois field GF( p m ) and a formula for calculation of the formal derivative are considered. Calculation of the formal derivative of the polynomial is used in the decoding algorithm of the information frames during application of the Reed-Solomon codes, which are widely used in the data transmission and storage systems with the data redundancy. The definition of the formal derivative of polynomial over the Galois field GF( p m ) and the recurrent algorithm offered by the author for calculation of the value of the formal derivative of the polynomial over the Galois field GF( p m ) with a given argument are also presented. Finally, the hardware implementation of the offered calculation scheme for the case of binary Galois field GF(2 m ) is also given.