A Dickson-polynomial isomorphism yields an O(ep) factorization algorithm for x^{p+1}-1 over Z_{p^e} and near-optimal LCD codes of length 182 over Z_169 with a robustness plateau in minimum distance.
LCD codes over finite chain rings.Finite Fields Their Appl., 34:1–19, 2015
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
-
Explicit Factorization of $x^{p+1}-1$ over $\mathbb{Z}_{p^e}$: A Structural Approach via Dickson Polynomials
A Dickson-polynomial isomorphism yields an O(ep) factorization algorithm for x^{p+1}-1 over Z_{p^e} and near-optimal LCD codes of length 182 over Z_169 with a robustness plateau in minimum distance.