Please use this identifier to cite or link to this item:
http://cmuir.cmu.ac.th/jspui/handle/6653943832/68352Full metadata record
| DC Field | Value | Language |
|---|---|---|
| dc.contributor.author | Hai Q. Dinh | en_US |
| dc.contributor.author | Xiaoqiang Wang | en_US |
| dc.contributor.author | Paravee Maneejuk | en_US |
| dc.date.accessioned | 2020-04-02T15:25:22Z | - |
| dc.date.available | 2020-04-02T15:25:22Z | - |
| dc.date.issued | 2020-01-01 | en_US |
| dc.identifier.issn | 21693536 | en_US |
| dc.identifier.other | 2-s2.0-85081651491 | en_US |
| dc.identifier.other | 10.1109/ACCESS.2020.2974866 | en_US |
| dc.identifier.uri | https://www.scopus.com/inward/record.uri?partnerID=HzOxMe3b&scp=85081651491&origin=inward | en_US |
| dc.identifier.uri | http://cmuir.cmu.ac.th/jspui/handle/6653943832/68352 | - |
| 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.subject | Computer Science | en_US |
| dc.subject | Engineering | en_US |
| dc.subject | Materials Science | en_US |
| dc.title | On the Hamming Distance of Repeated-Root Cyclic Codes of Length 6p<sup>s</sup> | en_US |
| dc.type | Journal | en_US |
| article.title.sourcetitle | IEEE Access | en_US |
| article.volume | 8 | en_US |
| article.stream.affiliations | Ton-Duc-Thang University | en_US |
| article.stream.affiliations | Hubei University | en_US |
| article.stream.affiliations | Chiang Mai University | en_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.