The correspondence conjecture for trinomial-associated polycyclic codes
The correspondence conjecture for trinomial-associated polycyclic codes
Let and be polynomials in with equal order, and let and denote the sets of length- polycyclic codes over associated with and , respectively. Correspondence conjecture. If
then and are in a one-to-one correspondence, with corresponding codes equivalent to each other. This proposes a trinomial analogue of known correspondence results for constacyclic codes; the source gives computational evidence but no proof or resolution.
Sources & referencesView supporting material
Primary source
Nuh Aydin, Peihan Liu and Bryan Yoshino, “Polycyclic Codes Associated with Trinomials: Good Codes and Open Questions”, arXiv:2106.12065 (2021).
Progress summary
The proposed rule is false: a concrete counterexample shows that equal-order trinomial polynomials need not produce corresponding equivalent code families.
The 2021 paper formulates the equal-order correspondence as Conjecture , based on computation rather than proof. It concerns trinomials and over .
Known results
- The original paper proves equal orders in the mutually reciprocal special case, including and (2021).
- Under the stricter condition , a later paper proves the required one-to-one correspondence and equivalence (2022).
2022 counterexample
The later paper disproves Conjecture : over , and both have order , but their code sets contain and linear codes, respectively. Thus the proposed correspondence cannot exist.
Current status (as of August 2026): the original equal-order correspondence conjecture is settled false by the counterexample, while narrower reciprocal and special-family equivalence results remain valid.
Solutions 0
Sign in to submit a solution.
No solutions have been posted yet.