The equal-order correspondence conjecture for polycyclic codes associated with trinomials
The equal-order correspondence conjecture for polycyclic codes associated with trinomials
Let and satisfy
Let be the set of all polycyclic codes of length over associated with , and let be the corresponding set for . The equal-order correspondence conjecture. The sets and are in one-to-one correspondence, with corresponding codes equivalent to each other. The source paper states that the original conjecture is incorrect and gives a counterexample, so this claim is refuted in the source context.
Sources & referencesView supporting material
Primary source
Minjia Shi, Haodong Lu, Shuang Zhou, Jiarui Xu and Yuhang Zhu, “Equivalence and Duality of Polycyclic Codes Associated with Trinomials over Finite Fields”, arXiv:2204.12433 (2022).
Progress summary
The conjecture is false: a published counterexample shows that equal polynomial order does not guarantee the proposed correspondence.
The conjecture appeared as Conjecture in a paper on polycyclic codes associated with trinomials, motivated by computational evidence. It asserted a one-to-one correspondence between the two code families, preserving code equivalence, whenever the defining trinomials have equal order.
Known results
- The original equal-order condition was proposed as a conjecture, not proved, in .
- A corrected theorem replaces equal order by the reciprocal relation and establishes the desired correspondence under that stronger hypothesis.
2022 counterexample
The later paper states that Conjecture is incorrect. Over , it uses and , both of order , but their associated families contain respectively and linear codes; hence the conjectured correspondence cannot exist. The work was listed with metadata and later publication information.
Current status (as of August 2026): The original equal-order correspondence conjecture is settled as false, while the stronger reciprocal-polynomial correspondence is the valid replacement.
Solutions 0
Sign in to submit a solution.
No solutions have been posted yet.