Revisiting the factorization of \(x^n+1\) over finite fields with applications (Q1983385)
From MaRDI portal
!
This is the item page for this Wikibase entity, intended for internal use and editing purposes. Please use the normal view instead:
scientific article; zbMATH DE number 7393931
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| English | Revisiting the factorization of \(x^n+1\) over finite fields with applications |
scientific article; zbMATH DE number 7393931 |
Statements
Revisiting the factorization of \(x^n+1\) over finite fields with applications (English)
0 references
10 September 2021
0 references
Summary: The polynomial \(x^n+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 \(x^n+1\) over finite fields is given as well as its applications. Explicit and recursive methods for factorizing \(x^n+1\) over finite fields are provided together with the enumeration formula. As applications, some families of negacyclic codes are revisited with more clear and simpler forms.
0 references
0 references
0 references
0.8665019273757935
0 references
0.7969469428062439
0 references
0.7909738421440125
0 references
0.7882179617881775
0 references
0.7877191305160522
0 references
