Please use this identifier to cite or link to this item:
Full metadata record
DC FieldValueLanguage
dc.contributor.authorHai Q. Dinhen_US
dc.contributor.authorJamal Laaouineen_US
dc.contributor.authorMohammed E. Charkanien_US
dc.contributor.authorWarattaya Chinnakumen_US
dc.description.abstractLet $p$ be any prime, $s$ and $m$ be positive integers. In this paper, we completely determine the Hamming distance of all constacyclic codes of length ps$ over the finite commutative chain ring $\mathbb {F}{pm}+ u\mathbb {F}{pm} + u{2}\mathbb {F}{pm}\,\,\, (u3=0)$. As applications, we identify all maximum distance saparable codes (i.e., optimal codes with respect to the Singleton bound) among them.en_US
dc.subjectComputer Scienceen_US
dc.subjectMaterials Scienceen_US
dc.titleHamming distance of constacyclic codes of length p<sup>s</sup>over F<inf>p</inf><sup>m</sup>CuF<inf>p</inf><sup>m</sup>Cu<sup>2</sup>Fp<sup>m</sup>en_US
article.title.sourcetitleIEEE Accessen_US
article.volume9en_US Universityen_USé des Sciences Dhar El Mahraz, Université Sidi Mohamed Ben Abdellahen_US Mai Universityen_US
Appears in Collections:CMUL: Journal Articles

Files in This Item:
There are no files associated with this item.

Items in CMUIR are protected by copyright, with all rights reserved, unless otherwise indicated.