On constacyclic codes over finite chain rings

Repeated root constacyclic codes of length mps over 𝔽pr + u𝔽pr + ⋯ + ue-1𝔽pr

“…Note that a similar result to the following theorem was discovered recently and independently by Cao [5].…”

Left dihedral codes over Galois rings GR(p2,m)

“…, c n−1 ) ∈ C, and C is said to be cyclic (negacyclic) when λ = 1 (λ = −1). Readers are referred to [17], [20], [21], [25], [27], [32] and [34] for results on linear codes, cyclic codes and constacyclic codes over finite chain rings. Moreover, various decoding schemes for codes over Galois rings have been considered in [11][12][13].…”

Negacyclic codes over the local ring Z4[v]/〈v2Chen1, Cao2 2018Finite Fields and Their ApplicationsSelf Cite7050View full textAdd to dashboardCite

“…From this we deduce that S satisfying condition (7) if and only if S satisfies the following condition:…”