Please use this identifier to cite or link to this item:
|Title:||Optimal b -symbol constacyclic codes with respect to the Singleton bound|
|Authors:||Hai Q. Dinh|
|Abstract:||© 2020 World Scientific Publishing Company. Let q be the finite field of order q, where q is a power of odd prime p. Assume that γ, λ are nonzero elements of the finite field q such that γps = λ. In this paper, we determine the b-distance of λ-constacyclic codes with generator polynomials (xδ - γ)i of length δps, where b ≤ δ and 0 ≤ i ≤ ps. As an application, all maximum distance separable (MDS) b-symbol constacyclic codes of length δps over q are established. Among other results, we construct several classes of new MDS symbol-pair codes with minimum symbol-pair distance six or seven by using repeated-root cyclic codes of length 4p and p, respectively, where is an odd prime.|
|Appears in Collections:||CMUL: Journal Articles|
Files in This Item:
There are no files associated with this item.
Items in CMUIR are protected by copyright, with all rights reserved, unless otherwise indicated.