2000 character limit reached
Some Constacyclic Codes over Finite Chain Rings
Published 15 Dec 2012 in cs.IT and math.IT | (1212.3704v1)
Abstract: For $\lambda$ an $n$-th power of a unit in a finite chain ring we prove that $\lambda$-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 $\alpha +p \beta$-constacyclic codes of length $ps$ over the Galois ring $GR(pe,r)$.
Paper Prompts
Sign up for free to create and run prompts on this paper using GPT-5.
Top Community Prompts
Collections
Sign up for free to add this paper to one or more collections.
