On the Symbol-Pair Distance of Repeated-Root Constacyclic Codes of Prime Power Lengths
© 1963-2012 IEEE. Let p be a prime, and λ be a nonzero element of the finite field Fpm. The λ-constacyclic codes of length psover Fpmare linearly ordered under set-theoretic inclusion, i.e., they are the ideals (x-λ0)i, 0 ≤ i ≤ psof the chain ring [(Fpm[x])/(xps-λ)]. This structure is used to establ...
Saved in:
| Main Authors: | , , , |
|---|---|
| Format: | Journal |
| Published: |
2018
|
| Subjects: | |
| Online Access: | https://www.scopus.com/inward/record.uri?partnerID=HzOxMe3b&scp=85028917637&origin=inward http://cmuir.cmu.ac.th/jspui/handle/6653943832/58508 |
| Tags: |
Add Tag
No Tags, Be the first to tag this record!
|
| Institution: | Chiang Mai University |
| Summary: | © 1963-2012 IEEE. Let p be a prime, and λ be a nonzero element of the finite field Fpm. The λ-constacyclic codes of length psover Fpmare linearly ordered under set-theoretic inclusion, i.e., they are the ideals (x-λ0)i, 0 ≤ i ≤ psof the chain ring [(Fpm[x])/(xps-λ)]. This structure is used to establish the symbol-pair distances of all such λ-constacyclic codes. Among others, all maximum distance separable symbol-pair constacyclic codes of length p^{s} are obtained. |
|---|