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 |
id |
th-cmuir.6653943832-68452 |
---|---|
record_format |
dspace |
spelling |
th-cmuir.6653943832-684522020-04-02T15:27:38Z On the b-distance of repeated-root constacyclic codes of prime power lengths Hai Q. Dinh Xiaoqiang Wang Hongwei Liu Songsak Sriboonchitta Mathematics © 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. 2020-04-02T15:27:38Z 2020-04-02T15:27:38Z 2020-04-01 Journal 0012365X 2-s2.0-85076711891 10.1016/j.disc.2019.111780 https://www.scopus.com/inward/record.uri?partnerID=HzOxMe3b&scp=85076711891&origin=inward http://cmuir.cmu.ac.th/jspui/handle/6653943832/68452 |
institution |
Chiang Mai University |
building |
Chiang Mai University Library |
country |
Thailand |
collection |
CMU Intellectual Repository |
topic |
Mathematics |
spellingShingle |
Mathematics Hai Q. Dinh Xiaoqiang Wang Hongwei Liu Songsak Sriboonchitta On the b-distance of repeated-root constacyclic codes of prime power lengths |
description |
© 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. |
format |
Journal |
author |
Hai Q. Dinh Xiaoqiang Wang Hongwei Liu Songsak Sriboonchitta |
author_facet |
Hai Q. Dinh Xiaoqiang Wang Hongwei Liu Songsak Sriboonchitta |
author_sort |
Hai Q. Dinh |
title |
On the b-distance of repeated-root constacyclic codes of prime power lengths |
title_short |
On the b-distance of repeated-root constacyclic codes of prime power lengths |
title_full |
On the b-distance of repeated-root constacyclic codes of prime power lengths |
title_fullStr |
On the b-distance of repeated-root constacyclic codes of prime power lengths |
title_full_unstemmed |
On the b-distance of repeated-root constacyclic codes of prime power lengths |
title_sort |
on the b-distance of repeated-root constacyclic codes of prime power lengths |
publishDate |
2020 |
url |
https://www.scopus.com/inward/record.uri?partnerID=HzOxMe3b&scp=85076711891&origin=inward http://cmuir.cmu.ac.th/jspui/handle/6653943832/68452 |
_version_ |
1681426822563102720 |