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 …
On self-dual mds codes
Did you know?
Web1 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. Web26 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 …
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 … Web7 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. …
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 … 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 …
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 …
Web12 de jul. de 2024 · In recent years, study of self-dual maximum distance separable (MDS) codes have attracted a lot of attention [1, 4, 11,12,13,14,15, 20, 21, 32, 33, 36].First of … diamond brooch pngWebIn this paper, we consider the problem for which lengths a maximum distance separable (MDS) Euclidean self-dual code over diamond brothers taylorville ilWeb1 de jan. de 2024 · In Theorem 3.1, we have proved that, when q ≡ 3 ( mod 4), there exists an MDS self-dual code of length n = p e + 1 where e is an odd integer. This gives a … diamond brothers insurance savoy ilWeb25 de abr. de 2024 · It is proved that there is no 2 × 2 antiorthogonal matrix over G R ( 2 m , r ) with m ≥ 2 and odd r. 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 … diamond brothers hatton gardenWeb1 de jan. de 2024 · In Section 3, we present our general results on the constructions of MDS self-dual codes over F q by using cyclotomic classes of F q ⁎. Then we show several … circline cruise new yorkWebself-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 diamond brothers insurance champaign ilWeb27 de jul. de 2024 · Since MDS self-dual codes over finite field of even characteristic with any possible parameter have been found in [References].In this paper, we obtain some new results on the existence of MDS self-dual codes through (extended) G R S codes over finite fields of odd characteristic. Some results in this paper extend those of [References] … diamond brown instagram pictures