Skew polycyclic codes over finite chain rings defined by trinomials are Hamming equivalent to those from x^n - (x^ℓ + 1) under stated conditions, reducing classification to a canonical case via a group-theoretic equivalence on trinomials.
On poly- cyclic codes over a finite chain ring
1 Pith paper cite this work. Polarity classification is still indexing.
1
Pith paper citing it
fields
cs.IT 1years
2026 1verdicts
UNVERDICTED 1representative citing papers
citing papers explorer
-
Skew polycyclic over finite chain rings associated to trinomials
Skew polycyclic codes over finite chain rings defined by trinomials are Hamming equivalent to those from x^n - (x^ℓ + 1) under stated conditions, reducing classification to a canonical case via a group-theoretic equivalence on trinomials.