scholarly journals MDS Self-Dual Codes and Antiorthogonal Matrices over Galois Rings

Information ◽  
2019 ◽  
Vol 10 (4) ◽  
pp. 153
Author(s):  
Sunghyu Han

In this study, we explore maximum distance separable (MDS) self-dual codes over Galois rings G R ( p m , r ) with p ≡ − 1 ( mod 4 ) and odd r. Using the building-up construction, we construct MDS self-dual codes of length four and eight over G R ( p m , 3 ) with ( p = 3 and m = 2 , 3 , 4 , 5 , 6 ), ( p = 7 and m = 2 , 3 ), ( p = 11 and m = 2 ), ( p = 19 and m = 2 ), ( p = 23 and m = 2 ), and ( p = 31 and m = 2 ). In the building-up construction, it is important to determine the existence of a square matrix U such that U U T = − I , which is called an antiorthogonal matrix. We prove that there is no 2 × 2 antiorthogonal matrix over G R ( 2 m , r ) with m ≥ 2 and odd r.

2021 ◽  
Vol 28 (04) ◽  
pp. 581-600
Author(s):  
Hai Q. Dinh ◽  
Hualu Liu ◽  
Roengchai Tansuchat ◽  
Thang M. Vo

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


Entropy ◽  
2019 ◽  
Vol 21 (2) ◽  
pp. 101 ◽  
Author(s):  
Aixian Zhang ◽  
Zhe Ji

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.


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

2007 ◽  
Vol 45 (2) ◽  
pp. 247-258 ◽  
Author(s):  
Jon-Lark Kim ◽  
Yoonjin Lee
Keyword(s):  

Sign in / Sign up

Export Citation Format

Share Document