In this contribution we show how to find y(x) in the polynomial equation y(x)(p) = t(x) mod f(x), where t(x), y(x) and f(x) are polynomials over the field GF(p(m)). The solution of such equations are thought for in many cases, e.g.. for p = 2 it is a step in the so-called Patterson Algorithm for decoding binary Goppa codes.
机构:
Nanyang Technol Univ, Div Math Sci, Sch Phys & Math Sci, Singapore, SingaporeNanyang Technol Univ, Div Math Sci, Sch Phys & Math Sci, Singapore, Singapore
Ling, San
Ozdemir, Enver
论文数: 0引用数: 0
h-index: 0
机构:
Nanyang Technol Univ, Div Math Sci, Sch Phys & Math Sci, Singapore, SingaporeNanyang Technol Univ, Div Math Sci, Sch Phys & Math Sci, Singapore, Singapore
Ozdemir, Enver
Xing, Chaoping
论文数: 0引用数: 0
h-index: 0
机构:
Nanyang Technol Univ, Div Math Sci, Sch Phys & Math Sci, Singapore, SingaporeNanyang Technol Univ, Div Math Sci, Sch Phys & Math Sci, Singapore, Singapore