Hamming and Symbol-Pair Distances of Repeated-Root Constacyclic Codes of Prime Power Lengths over Fpm + uFpm
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...
Saved in:
| Main Authors: | , , , |
|---|---|
| Format: | Journal |
| Published: |
2018
|
| Subjects: | |
| Online Access: | https://www.scopus.com/inward/record.uri?partnerID=HzOxMe3b&scp=85052869785&origin=inward http://cmuir.cmu.ac.th/jspui/handle/6653943832/62650 |
| Tags: |
Add Tag
No Tags, Be the first to tag this record!
|
| Institution: | Chiang Mai University |
| Summary: | 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. |
|---|