Equivalence of Families of Polycyclic Codes over Finite Fields

2025/03/06 by Ou-azzou, Hassan, Horlemann, Anna-Lena · 1 citation
#FOS: Computer and information sciences #Information Theory (cs.IT)

paper · doi:10.48550/arxiv.2503.04498

Abstract

We study the equivalence of families of polycyclic codes associated with polynomials of the form xⁿ - a_n-1x^n-1 - … - a₁x - a₀ over a finite field. We begin with the specific case of polycyclic codes associated with a trinomial xⁿ - a_ℓ x^ℓ - a₀ (for some 0< ℓ

Cited by

• Using nonassociative algebras to classify skew polycyclic codes up to isometry and equivalence

Related

• Equivalence and Duality of Polycyclic Codes Associated with Trinomials over Finite Fields
• On polycyclic linear and additive codes associated to a trinomial over a finite chain ring
• Bounds and Equivalence of Skew Polycyclic Codes over Finite Fields
• Polycyclic Codes Associated with Trinomials: Good Codes and Open Questions
• Revisiting the Factorization of xⁿ+1 over Finite Fields