On self-dual mds codes
Webself-dual). For the study of self-dual codes, the reader is referred to [38]. The weight distribution of a code is the sequence of integers A i sfori = 0,1,...,n, where Ai is the number of codewords of weight i. A code is Euclidean (resp. Hermitian) formally self-dual (FSD) if it has the same weight distribution as its dual code with respect Web1 de out. de 2002 · MDS Self-Dual Codes over Large Prime Fields. S. Georgiou, C. Koukouvinos. Published 1 October 2002. Computer Science, Mathematics. Finite Fields and Their Applications. Combinatorial designs have been used widely in the construction of self-dual codes. Recently a new method of constructing self-dual codes was established …
On self-dual mds codes
Did you know?
Web1 de mar. de 2024 · It is easy to see that parameters of a MDS self-dual code are completely determined by the code length. The main problem in this topic is to determine existence of q-ary MDS self-dual codes of various lengths. The problem is completely solved when q is even. This paper focuses on the case that q is odd. We generalize the … Web26 de fev. de 2024 · In this paper, we produce new classes of MDS self-dual codes via (extended) generalized Reed–Solomon codes over finite fields of odd characteristic. …
Webself-dual). For the study of self-dual codes, the reader is referred to [38]. The weight distribution of a code is the sequence of integers A i sfori = 0,1,...,n, where Ai is the … WebThis paper is organized as follows. In Section 2, we present basic facts regarding Galois rings, linear codes over , MDS codes, self-dual codes, and building-up construction. In Section 3, we discuss MDS self-dual codes over with and odd r, and we give our computational results for those codes. Specifically, we construct MDS self-dual codes …
Web12 de nov. de 2024 · It seems more challenging to construct self-dual NMDS codes than self-dual MDS codes. The only work on construction of self-dual NMDS codes shows existence of q-ary self-dual NMDS codes of length q - 1 for odd prime power q or length up to 16 for some small primes q with q ≤ 197. In this paper, we make use of properties of … Web8 de abr. de 2024 · In this paper, we develop a general method for constructing linear codes with small hulls using the eigenvalues of the generator matrices. Using this method, we …
Web13 de jul. de 2024 · Furthermore, our general constructions provide many MDS self-dual codes with new parameters which, to the best of our knowledge, were not reported …
Web11 de ago. de 2008 · MDS (selfdual) linear codes exist in a very restricted condition on their lengths as the famous MDS conjecture states: for every linear [n, k, n − k + 1] MDS … sharons sanctuaryWeb1 de mar. de 2024 · Many optimal Hermitian self-dual codes over large finite fields with new parameters are obtained. More precisely MDS or almost MDS Hermitian self-dual codes of lengths up to 18 are constructed over finite fields F q, where q = 3 2, 4 2, 5 2, 7 2, 8 2, 9 2, 11 2, 13 2, 17 2, 19 2. Comparisons with classical constructions are made. porcelain hutschenreutherWeb13 de nov. de 2024 · In this paper we present a series of MDS self-dual codes with new length by using generalized Reed-Solomon codes and extended generalized Reed … porcelain hot water bottleWeb7 de nov. de 2024 · In this paper, we produce new classes of MDS self-dual codes via (extended) generalized Reed-Solomon codes over finite fields of odd characteristic. … sharons silk flower outletWeb26 de ago. de 2008 · Abstract: We construct new MDS or near-MDS self-dual codes over large finite fields. In particular, we show that there exists a Euclidean self-dual MDS … sharons sew n goWebSelf-dual maximum distance separable codes (self-dual MDS codes) and self-dual near MDS codes are very important in coding theory and practice. Thus, it is interesting to … sharons southern blingsharons slices colyton