Skew constacyclic codes over finite chain rings

From MaRDI portal
Publication:414946

DOI10.3934/AMC.2012.6.39zbMATH Open1279.94146arXiv1008.0327OpenAlexW2963945674WikidataQ62577995 ScholiaQ62577995MaRDI QIDQ414946FDOQ414946


Authors: Somphong Jitman, San Ling, Patanee Udomkavanich Edit this on Wikidata


Publication date: 11 May 2012

Published in: Advances in Mathematics of Communications (Search for Journal in Brave)

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 xnlambda, 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 mathbbFpm+umathbbFpm. 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 mathbbF3+umathbbF3 and their Euclidean and Hermitian dual codes is also provided.


Full work available at URL: https://arxiv.org/abs/1008.0327




Recommendations





Cited In (67)





This page was built for publication: Skew constacyclic codes over finite chain rings

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q414946)