On Symbol-Pair Distance of a Class of Constacyclic Codes of Length 3Ips/I over F[sub.pm]+uF[sub.pm]
Let p≠3 be any prime. In this paper, we compute symbol-pair distance of all γ-constacyclic codes of length 3p[sup.s] over the finite commutative chain ring R=F[sub.pm] +uF[sub.pm] , where γ is a unit of R which is not a cube in F[sub.pm] . We give the necessary and sufficient condition for a symbol-...
Saved in:
Published in: | Axioms Vol. 12; no. 3 |
---|---|
Main Authors: | , , |
Format: | Journal Article |
Language: | English |
Published: |
MDPI AG
01-03-2023
|
Subjects: | |
Online Access: | Get full text |
Tags: |
Add Tag
No Tags, Be the first to tag this record!
|
Summary: | Let p≠3 be any prime. In this paper, we compute symbol-pair distance of all γ-constacyclic codes of length 3p[sup.s] over the finite commutative chain ring R=F[sub.pm] +uF[sub.pm] , where γ is a unit of R which is not a cube in F[sub.pm] . We give the necessary and sufficient condition for a symbol-pair γ-constacyclic code to be an MDS symbol-pair code. Using that, we provide all MDS symbol-pair γ-constacyclic codes of length 3p[sup.s] over R. Some examples of the symbol-pair distance of γ-constacyclic codes of length 3p[sup.s] over R are provided. |
---|---|
ISSN: | 2075-1680 2075-1680 |
DOI: | 10.3390/axioms12030254 |