English (United Kingdom)

https://curated-unify.zendy.io/wp-json/zendy-region/v1/featured_content/oa?rat=en

https://curated-unify.zendy.io/wp-json/zendy-region/v1/highlighted_journal/

Global: Zendy Plus annual

Presents the access of premium content as premium feature

Premium Content

Presents the keyphrase highlighting as premium feature

Keyphrase Highlighting

Presents the summarisation as premium feature

Summarisation

Insights

Presents the pdf analysis as premium feature

PDF Analysis

Presents the zaia usage as premium feature

ZAIA

Global: Zendy Plus monthly

Global: Zendy Tools annual

Global: Zendy Tools monthly

Global: Zendy Free Plan

Let $p\neq3$ be any prime and $l\neq3$ be any odd prime with $gcd(p,l)=1$.$F_{q}^{*}=\langle\xi\rangle$ is decomposed into mutually disjoint union of$gcd(q-1,3lp^{s})$ coset over the subgroup $\langle\xi^{3lp^{s}}\rangle$, where$\xi$ is a primitive $(q-1)$th root of unity. We classify all repeated-rootconstacyclic codes of length $3lp^{s}$ over the finite field $F_{q}$ into someequivalence classes by the decomposition, where $q=p^{m}$, $s$ and $m$ arepositive integers. According to the equivalence classes, we explicitlydetermine the generator polynomials of all repeated-root constacyclic codes oflength $3lp^{s}$ over $F_{q}$ and their dual codes. Self-dualcyclic(negacyclic) codes of length $3lp^{s}$ over $F_{q}$ exist only when$p=2$. And we give all self-dual cyclic(negacyclic) codes of length$3l2^{s}$over $F_{2^{m}}$ and its enumeration.

Repeated-root constacyclic codes of length $3lp^{s}$ and their dual codes