Please use this identifier to cite or link to this item:
http://cmuir.cmu.ac.th/jspui/handle/6653943832/62650
Full metadata record
DC Field | Value | Language |
---|---|---|
dc.contributor.author | Hai Q. Dinh | en_US |
dc.contributor.author | Bac Trong Nguyen | en_US |
dc.contributor.author | Abhay Kumar Singh | en_US |
dc.contributor.author | Songsak Sriboonchitta | en_US |
dc.date.accessioned | 2018-11-29T07:38:08Z | - |
dc.date.available | 2018-11-29T07:38:08Z | - |
dc.date.issued | 2018-09-04 | en_US |
dc.identifier.issn | 15582558 | en_US |
dc.identifier.issn | 10897798 | en_US |
dc.identifier.other | 2-s2.0-85052869785 | en_US |
dc.identifier.other | 10.1109/LCOMM.2018.2868637 | en_US |
dc.identifier.uri | https://www.scopus.com/inward/record.uri?partnerID=HzOxMe3b&scp=85052869785&origin=inward | en_US |
dc.identifier.uri | http://cmuir.cmu.ac.th/jspui/handle/6653943832/62650 | - |
dc.description.abstract | IEEE The ring R = Fpm + uFpm has precisely pm(pm–1) units, which are of the forms γ and α+uβ, where 0 ≠ α,β,γ ∈ Fpm. Using generator polynomial structures of constacyclic codes of length ps over R, the Hamming and symbol-pair distance distributions of all such codes are completely determined. As examples, we provide some good codes with better parameters than the known ones. | en_US |
dc.subject | Computer Science | en_US |
dc.subject | Engineering | en_US |
dc.subject | Mathematics | en_US |
dc.title | Hamming and Symbol-Pair Distances of Repeated-Root Constacyclic Codes of Prime Power Lengths over Fpm + uFpm | en_US |
dc.type | Journal | en_US |
article.title.sourcetitle | IEEE Communications Letters | en_US |
article.stream.affiliations | Kent State University | en_US |
article.stream.affiliations | Duy Tan University | en_US |
article.stream.affiliations | Indian Institute of Technology (Indian School of Mines), Dhanbad | 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.