scholarly journals Construction of Maximum Distance Separable Rhotrices using Cauchy Rhotrices over Finite Fields

2017 ◽  
Vol 168 (9) ◽  
pp. 8-17
Author(s):  
P. L. ◽  
Shalini Gupta ◽  
Neetu Dhiman
Keyword(s):  
Finite Fields ◽  
Maximum Distance ◽  
Maximum Distance Separable

Maximum Distance Separable Hankel Rhotrices over Finite Fields

2018 ◽  
Vol 43 (1-4) ◽  
pp. 13-45
Author(s):  
Prof. P. L. Sharma ◽  
◽  
Mr. Arun Kumar ◽  
Mrs. Shalini Gupta ◽  
◽  
...  
Keyword(s):  
Finite Fields ◽  
Maximum Distance ◽  
Maximum Distance Separable

scholarly journals New Construction of Maximum Distance Separable (MDS) Self-Dual Codes over Finite Fields

Entropy ◽  
2019 ◽  
Vol 21 (2) ◽  
pp. 101 ◽  
Author(s):  
Aixian Zhang ◽  
Zhe Ji
Keyword(s):  
Finite Fields ◽  
Maximum Distance ◽  
Dual Codes ◽  
Self Duality ◽  
Reed Solomon Codes ◽  
Interesting Topic ◽  
Singleton Bound ◽  
Maximum Distance Separable ◽  
New Construction

Maximum distance separable (MDS) self-dual codes have useful properties due to their optimality with respect to the Singleton bound and its self-duality. MDS self-dual codes are completely determined by the length n , so the problem of constructing q-ary MDS self-dual codes with various lengths is a very interesting topic. Recently X. Fang et al. using a method given in previous research, where several classes of new MDS self-dual codes were constructed through (extended) generalized Reed-Solomon codes, in this paper, based on the method given in we achieve several classes of MDS self-dual codes.

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].

Sign in / Sign up

Export Citation Format

Share Document