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.authorParavee Maneejuken_US
dc.description.abstract© 2013 IEEE. Let p be an odd prime, s , m be positive integers such that pm≡ 2 pmod 3. In this paper, using the relationship about Hamming distances between simple-root cyclic codes and repeated-root cyclic codes, the Hamming distance of all cyclic codes of length 6ps over finite field Fpm is obtained. All maximum distance separable (MDS) cyclic codes of length 6ps are established.en_US
dc.subjectComputer Scienceen_US
dc.subjectMaterials Scienceen_US
dc.titleOn the Hamming Distance of Repeated-Root Cyclic Codes of Length 6p<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.