Revisiting the Factorization of xn+1 over Finite Fields with Applications
The polynomial xn+1 over finite fields has been of interest due to its applications in the study of negacyclic codes over finite fields. In this paper, a rigorous treatment of the factorization of xn+1 over finite fields is given as well as its applications. Explicit and recursive methods for factor...
Saved in:
Main Authors: | Arunwan Boripan, Somphong Jitman |
---|---|
Format: | Article |
Language: | English |
Published: |
Wiley
2021-01-01
|
Series: | Journal of Mathematics |
Online Access: | http://dx.doi.org/10.1155/2021/6626422 |
Tags: |
Add Tag
No Tags, Be the first to tag this record!
|
Similar Items
-
On the matrix equation Xn=B over finite fields
by: Maria T. Acosta-De-Orozco, et al.
Published: (1993-01-01) -
On the recursive sequence xn+1=−1/xn+A/xn−1
by: Stevo Stević
Published: (2001-01-01) -
Global Behavior of the Difference Equation xn+1=xn-1g(xn)
by: Hongjian Xi, et al.
Published: (2014-01-01) -
Global Behavior of the Max-Type Difference Equation xn+1=max{1/xn,An/xn−1}
by: Taixiang Sun, et al.
Published: (2009-01-01) -
On the Solutions of the System of Difference Equations xn+1=max{A/xn,yn/xn}, yn+1=max{A/yn,xn/yn}
by: Dağistan Simsek, et al.
Published: (2009-01-01)