Self-conjugate-reciprocal irreducible monic factors of x^n-1 over finite fields and their applications

DOI10.1016/J.FFA.2018.09.004MaRDI QIDQ1633284zbMATH OpenOpenAlexDBLPWikidataFDO

Authors Arunwan Boripan, Somphong Jitman, Patanee Udomkavanich

Publication date 19 December 2018

Published in Finite Fields and their Applications (Search for Journal in Brave)

Full work available at URL https://arxiv.org/abs/1804.06138

zbMATH Keywords

complementary dual cyclic codesself-conjugate-reciprocal polynomialsself-dual cyclic codesself-reciprocal polynomials

Mathematics Subject Classification ID

Polynomials over finite fields (11T06) Algebraic coding theory; cryptography (number-theoretic aspects) (11T71) Linear codes (general theory) (94B05)

Abstract: Self-reciprocal and self-conjugate-reciprocal polynomials over finite fields have been of interest due to their rich algebraic structures and wide applications. Self-reciprocal irreducible monic factors of $x^n-1$ over finite fields and their applications have been quite well studied. In this paper, self-conjugate-reciprocal irreducible monic (SCRIM) factors of $x^n-1$ over finite fields of square order have been focused on. The characterization of such factors is given together the enumeration formula. In many cases, recursive formulas for the number of SCRIM factors of $x^n-1$ have been given as well. As applications, Hermitian complementary dual codes over finite fields and Hermitian self-dual cyclic codes over finite chain rings of prime characteristic have been discussed.

Recommendations

• SRIM and SCRIM factors of \(x^n+1\) over finite fields and their applications
• Self-reciprocal and self-conjugate-reciprocal irreducible factors of \(x^n - \lambda\) and their applications
• Self-reciprocal polynomials over finite fields
• Generalizations of self-conjugate-reciprocal polynomials
• Self-reciprocal irreducible polynomials over finite fields

Cites work

• Cyclic and Negacyclic Codes Over Finite Chain Rings
• Enumeration formulas for self-dual cyclic codes
• Hermitian LCD codes from cyclic codes
• Hermitian Self-Dual Abelian Codes
• Hulls of cyclic and negacyclic codes over finite fields
• On Self-Dual Cyclic Codes Over Finite Fields
• On some properties of self-reciprocal polynomials (Corresp.)
• On the divisors of a^k + b^k
• Self-reciprocal irreducible polynomials over finite fields
• The condition for a cyclic code to have a complementary dual

Cited in

(13)

• Hermitian duality of left dihedral codes over finite fields
• Construction and enumeration of left dihedral codes satisfying certain duality properties
• Self-reciprocal and self-conjugate-reciprocal irreducible factors of \(x^n - \lambda\) and their applications
• Generalizations of self-conjugate-reciprocal polynomials
• Möbius-Frobenius maps on irreducible polynomials
• Self-dual and complementary dual abelian codes over Galois rings
• SRIM and SCRIM factors of \(x^n+1\) over finite fields and their applications
• Some relations between the irreducible polynomials over a finite field and its quadratic extension
• Self-conjugate-reciprocal polynomials over finite fields and self-conjugate-reciprocal transformation
• Permutation polynomials over \(\mathbb{F}_{q^2}\) constructed from self-conjugate reciprocal polynomials
• Matrix product structure of left generalized quaternion group codes
• Some arithmetical properties of cyclotomic cosets and their applications
• Some properties of self-reciprocal polynomials

This page was built for publication: Self-conjugate-reciprocal irreducible monic factors of \(x^{n}-1\) over finite fields and their applications

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q1633284)