Equivalence and duality of polycyclic codes associated with trinomials over finite fields

Minjia Shi, Haodong Lu, Shuang Zhou, Jiarui Xu, Yuhang Zhu

TL;DR

This paper delves into the intricate world of polycyclic codes, a generalization of cyclic codes, by investigating their equivalence and duality properties, particularly when associated with trinomials. The authors resolve several open conjectures, providing new methods for constructing specific types of codes and clarifying existing theoretical results.

What Problem Does This Paper Address?

The paper tackles several conjectures presented in a previous work ([2]) concerning the equivalence and duality of polycyclic codes. Polycyclic codes, while a generalization of cyclic codes, have historically received less attention. This research aims to deepen our understanding of these codes, especially those linked to trinomials (polynomials with three terms), by resolving specific theoretical questions about their structural relationships and properties like self-duality and isoduality. The authors also aim to clarify when certain types of polycyclic codes, such as self-orthogonal or dual-containing codes, can or cannot exist.

Methods

The paper employs a combination of theoretical analysis and algebraic manipulation. Key methods include:

  • Algebraic Proofs: The authors rigorously prove theorems and propositions by manipulating polynomial properties, ideal structures, and code definitions.
  • Generator and Parity-Check Matrices: Standard tools in coding theory, these matrices are used extensively to represent codes and analyze their properties, particularly for proving equivalence and duality.
  • Reciprocal Polynomials: The concept of reciprocal polynomials is crucial for understanding duality and is used in several proofs and definitions.
  • Monomial Matrices: These matrices are employed to define and prove code equivalence.
  • Counter-examples: To disprove conjectures, the authors construct specific examples of polycyclic codes that violate the conjectured properties, often using computational tools (like Magma, as mentioned).
  • Case Analysis: For some proofs, the authors break down the problem into different cases based on the properties of the polynomials or field characteristics.

Datasets

Not discussed in the paper.

Key Insights and Ideas

  • Conjecture 3.5 is Incorrect: The paper demonstrates that the conjecture stating a one-to-one correspondence between sets of polycyclic codes associated with trinomials of the same order is not always true. This highlights that simply having the same order for associate polynomials isn't sufficient for a direct, equivalent mapping between their associated code sets.
  • New Construction Methods: The research provides effective methods for constructing isodual and self-dual polycyclic codes, particularly those associated with trinomials. This is a significant contribution to the practical generation of these specific code types.
  • Clarification on Existence: The paper definitively shows that certain types of polycyclic codes, specifically self-orthogonal or nontrivial dual-containing codes associated with trinomials over the binary field (F₂), do not exist. This resolves a theoretical question about their non-existence.
  • Unified Form for Self-Dual Codes: For self-dual polycyclic codes associated with trinomials, the generators are shown to have a specific, unified form, simplifying their characterization.
  • Isoduality Conditions: The work refines the understanding of conditions for isoduality, showing that while $g^2(x) = x^n - ax^i - b$ is a sufficient condition for isodual polycyclic codes over $F_q$, it's not always a necessary one.

Key Results

  • Resolution of Conjectures: The paper successfully resolves several conjectures from reference [2], including 3.5, 4.1, 4.2, 4.5, 4.7, 4.10, and 4.11.
  • Theorem 3.3: Establishes a one-to-one equivalence mapping between polycyclic codes associated with $t_1(x)$ and $t_2(x)$ when $t_2(x) = t_1(0)^{-1}t_1(x)$, providing a way to study codes associated with $f^*(x)$ by studying codes associated with $f(x)$.
  • Theorem 4.4: Provides a method to construct isodual polycyclic codes generated by $g(x)$ and associated with $g^2(x)$.
  • Theorem 5.1: Characterizes self-dual polycyclic codes associated with trinomials, showing their generators have the form $x^k - \alpha$ where $\alpha^2 = -1$, and that their minimum distance is 2.
  • Theorem 6.1: Proves that self-dual, self-orthogonal, or nontrivial dual-containing polycyclic codes associated with trinomials do not exist over $F_2$.
  • Counter-example to Conjecture 4.11: Example 6.1 demonstrates that prime-length polycyclic codes associated with trinomials can indeed be dual-containing, disproving Conjecture 4.11.

Limitations and Future Work

  • Computational Dependence: While theoretical proofs are provided, some results (like the number of codes in Example 3.1) are stated to be obtained via computational tools (Magma). This implies that for very large or complex cases, direct computation might be necessary.
  • Focus on Trinomials: The paper's primary focus is on polycyclic codes associated with trinomials. While this is a specific and important class, future work could explore equivalence and duality for polycyclic codes associated with other types of polynomials.
  • Generalizations: The paper addresses specific conjectures. Further research could explore broader generalizations of these results to more complex polynomial structures or different finite fields.
  • Practical Applications: While the paper contributes to the theoretical understanding of these codes, exploring their direct applications in error correction or other areas could be a future direction.

Summary updated

Abstract

In this paper, several conjectures proposed in [2] are studied, involving the equivalence and duality of polycyclic codes associated with trinomials. According to the results, we give methods to construct isodual and self-dual polycyclic codes, and study the self-orthogonal and dual-containing polycyclic codes over F2.
BibTeX
@inproceedings{shi2023equivalence,
  author = {Minjia Shi and Haodong Lu and Shuang Zhou and Jiarui Xu and Yuhang Zhu},
  title = {{Equivalence and duality of polycyclic codes associated with trinomials over finite fields}},
  booktitle = {Finite},
  year = {2023},
  doi = {10.1016/j.ffa.2023.102259},
}
Figure