Please use this identifier to cite or link to this item:
Full metadata record
DC FieldValueLanguage
dc.contributor.authorHai Q. Dinhen_US
dc.contributor.authorXiaoqiang Wangen_US
dc.contributor.authorJirakom Sirisrisakulchaien_US
dc.description.abstract© 2013 IEEE. Let p be a prime, s, m be positive integers, and λ be a nonzero element of the finite field Fpm. In this paper, the algebraic structures of constacyclic codes of length 5~ps~(p≠5) are obtained, which provide all self-dual, self-orthogonal and dual containing codes. Moreover, the exact values of the Hamming distances of all such codes are completely determined. Among other results, we obtain the degrees of the generator polynomials of all MDS repeated-root constacyclic codes of arbitrary length. As applications, several new and optimal codes are provided.en_US
dc.subjectComputer Scienceen_US
dc.subjectMaterials Scienceen_US
dc.titleOn the hamming distances of constacyclic codes of length 5p<sup>S</sup>en_US
article.title.sourcetitleIEEE Accessen_US
article.volume8en_US Universityen_US Universityen_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.