Papers
Topics
Authors
Recent
Search
2000 character limit reached

Skew Constacyclic Codes over Finite Chain Rings

Published 2 Aug 2010 in cs.IT, math.IT, and math.RA | (1008.0327v2)

Abstract: Skew polynomial rings over finite fields ([7] and [10]) and over Galois rings ([8]) have been used to study codes. In this paper, we extend this concept to finite chain rings. Properties of skew constacyclic codes generated by monic right divisors of $xn-\lambda$, where $\lambda$ is a unit element, are exhibited. When $\lambda2=1$, the generators of Euclidean and Hermitian dual codes of such codes are determined together with necessary and sufficient conditions for them to be Euclidean and Hermitian self-dual. Of more interest are codes over the ring $\mathbb{F}{pm}+u\mathbb{F}{pm}$. The structure of all skew constacyclic codes is completely determined. This allows us to express generators of Euclidean and Hermitian dual codes of skew cyclic and skew negacyclic codes in terms of the generators of the original codes. An illustration of all skew cyclic codes of length~2 over $\mathbb{F}{3}+u\mathbb{F}{3}$ and their Euclidean and Hermitian dual codes is also provided.

Citations (121)

Summary

Paper to Video (Beta)

Whiteboard

No one has generated a whiteboard explanation for this paper yet.

Open Problems

We haven't generated a list of open problems mentioned in this paper yet.

Continue Learning

We haven't generated follow-up questions for this paper yet.

Collections

Sign up for free to add this paper to one or more collections.