Abstract

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.

Highlights

  • The polynomial xn + 1 over finite fields plays an important role in the study of negacyclic codes

  • A negacyclic code of length n over Fq can be uniquely determined by an ideal in the principal ring Fq[x]/〈xn + 1〉 generated by a monic divisor of xn + 1

  • We focus on the factorization of xn + 1 over finite fields Fq for arbitrary positive integers n and all odd prime powers 1ps q

Read more

Summary

Introduction

The polynomial xn + 1 over finite fields plays an important role in the study of negacyclic codes (see [1,2,3,4,5] and references therein). In the case where the characteristic of F q is even, the factorization of xn + 1 xn − 1 over Fq has been given and applied in the study of cyclic codes over finite fields in [6]. Ordn′ (q) 1 over F is odd, a complete recursive q is provided together with factorization of a recursive formula for the number of its monic irreducible factors for all positive integers i. In the cases where ordn′ (q) is even, a recursive factorization of x2in′ + 1 over Fq is given for all positive integers i ≥ k.

Preliminary
Number Theoretical Results and Cyclotomic Cosets
Applications
Full Text
Paper version not known

Talk to us

Join us for a 30 min session where you can share your feedback and ask us any queries you have

Schedule a call

Disclaimer: All third-party content on this website/platform is and will remain the property of their respective owners and is provided on "as is" basis without any warranties, express or implied. Use of third-party content does not indicate any affiliation, sponsorship with or endorsement by them. Any references to third-party content is to identify the corresponding services and shall be considered fair use under The CopyrightLaw.