New LCD MDS codes constructed from generalized Reed–Solomon codes

2019 ◽  
Vol 18 (08) ◽  
pp. 1950150 ◽  
Author(s):  
Xueying Shi ◽  
Qin Yue ◽  
Shudi Yang
Keyword(s):  
Finite Field ◽  
Coding Theory ◽  
Theory And Practice ◽  
Maximum Distance ◽  
Mds Codes ◽  
Reed Solomon Codes ◽  
Maximum Distance Separable ◽  
Maximum Distance Separable Codes ◽  
Invertible Matrices

Maximum distance separable codes with complementary duals (LCD MDS codes) are very important in coding theory and practice, and have attracted a lot of attention. In this paper, we focus on LCD MDS codes constructed from generalized Reed–Solomon (GRS) codes over a finite field with odd characteristic. We detail two constructions of new LCD MDS codes, using invertible matrices and the roots of three classes of polynomials, respectively.

Symbol-Pair Distances of Repeated-Root Negacyclic Codes of Length 2s over Galois Rings

2021 ◽  
Vol 28 (04) ◽  
pp. 581-600
Author(s):  
Hai Q. Dinh ◽  
Hualu Liu ◽  
Roengchai Tansuchat ◽  
Thang M. Vo
Keyword(s):  
Finite Field ◽  
Galois Ring ◽  
Maximum Distance ◽  
Galois Rings ◽  
Constacyclic Codes ◽  
Chain Ring ◽  
Negacyclic Codes ◽  
Singleton Bound ◽  
Maximum Distance Separable ◽  
Special Case

Negacyclic codes of length [Formula: see text] over the Galois ring [Formula: see text] are linearly ordered under set-theoretic inclusion, i.e., they are the ideals [Formula: see text], [Formula: see text], of the chain ring [Formula: see text]. This structure is used to obtain the symbol-pair distances of all such negacyclic codes. Among others, for the special case when the alphabet is the finite field [Formula: see text] (i.e., [Formula: see text]), the symbol-pair distance distribution of constacyclic codes over [Formula: see text] verifies the Singleton bound for such symbol-pair codes, and provides all maximum distance separable symbol-pair constacyclic codes of length [Formula: see text] over [Formula: see text].

Maximum distance separable codes over $${\mathbb{Z}_4}$$ and $${\mathbb{Z}_2 \times \mathbb{Z}_4}$$

2010 ◽  
Vol 61 (1) ◽  
pp. 31-40 ◽  
Author(s):  
M. Bilal ◽  
J. Borges ◽  
S. T. Dougherty ◽  
C. Fernández-Córdoba
Keyword(s):  
Maximum Distance ◽  
Maximum Distance Separable ◽  
Maximum Distance Separable Codes
Sign in / Sign up

Export Citation Format

Share Document