On the b-distance of repeated-root constacyclic codes of prime power lengths
© 2019 Elsevier B.V. Let p be a prime, s, m be positive integers, λ be a nonzero element of the finite field Fpm. The b-distance generalizes the Hamming distance (b=1), and the symbol-pair distance (b=2). While the Hamming and symbol-pair distances of all λ-constacyclic codes of length ps are comple...
Saved in:
| Main Authors: | , , , |
|---|---|
| Format: | Journal |
| Published: |
2020
|
| Subjects: | |
| Online Access: | https://www.scopus.com/inward/record.uri?partnerID=HzOxMe3b&scp=85076711891&origin=inward http://cmuir.cmu.ac.th/jspui/handle/6653943832/68452 |
| Tags: |
Add Tag
No Tags, Be the first to tag this record!
|
| Institution: | Chiang Mai University |
| Summary: | © 2019 Elsevier B.V. Let p be a prime, s, m be positive integers, λ be a nonzero element of the finite field Fpm. The b-distance generalizes the Hamming distance (b=1), and the symbol-pair distance (b=2). While the Hamming and symbol-pair distances of all λ-constacyclic codes of length ps are completely determined, the general b-distance of such codes was left opened. In this paper, we provide a new technique to establish the b-distance of all λ-constacyclic codes of length ps, where 1≤b≤⌊ [Formula presented] ⌋. As an application, all MDS b-symbol constacyclic codes of length ps over Fpm are obtained. |
|---|