Abstract

For λλ an nn-th power of a unit in a finite chain ring we prove that λλ-constacyclic repeated-root codes over some finite chain rings are equivalent to cyclic codes. This allows us to simplify the structure of some constacylic codes. We also study the α+pβα+p β-constacyclic codes of length psp^s over the Galois ring GR(pe,r)GR(p^e,r).

Explore this paper’s authors, topics and related work.

Building this map preview

BZPEER is loading the nearby papers, people, topics and institutions for this page.

Reviews 0

Write a reviewWrite

No reviews yet.

Discussion 0

Add a commentWrite

No comments yet.