首页 | 本学科首页   官方微博 | 高级检索  
相似文献
 共查询到20条相似文献,搜索用时 0 毫秒
1.
2.
《Discrete Mathematics》2023,346(1):113126
New s-extremal extremal unimodular lattices in dimensions 38, 40, 42 and 44 are constructed from self-dual codes over F5 by Construction A. In the process of constructing these codes, we obtain a self-dual [44,22,14] code over F5. In addition, the code implies a [43,22,13] code over F5. These codes have larger minimum weights than the previously known [44,22] codes and [43,22] codes, respectively.  相似文献   

3.
4.
Self-dual codes over exist for all even lengths. The smallest length for which the largest minimum weight among self-dual codes has not been determined is 24, and the largest minimum weight is either 9 or 10. In this note, we show that there exists no self-dual [24, 12, 10] code over , using the classification of 24-dimensional odd unimodular lattices due to Borcherds.   相似文献   

5.
6.
The purpose of this paper is to construct nontrivial MDS self-dual codes over Galois rings. We consider a building-up construction of self-dual codes over Galois rings as a GF(q)-analogue of (Kim and Lee, J Combin Theory ser A, 105:79–95). We give a necessary and sufficient condition on which the building-up construction holds. We construct MDS self-dual codes of lengths up to 8 over GR(32,2), GR(33,2) and GR(34,2), and near-MDS self-dual codes of length 10 over these rings. In a similar manner, over GR(52,2), GR(53,2) and GR(72,2), we construct MDS self-dual codes of lengths up to 10 and near-MDS self-dual codes of length 12. Furthermore, over GR(112,2) we have MDS self-dual codes of lengths up to 12.   相似文献   

7.
8.
In this paper, we propose a mechanism on how to construct long MDS self-dual codes from short ones. These codes are special types of generalized Reed-Solomon (GRS) codes or extended generalized Reed-Solomon codes. The main tool is utilizing additive structure or multiplicative structure on finite fields. By applying this method, more MDS self-dual codes can be constructed.  相似文献   

9.
10.
11.
A classification of all extremal double circulant self-dual codes of lengths up to 72 is known. In this paper, we give a classification of all extremal double circulant self-dual codes of lengths 74-88.  相似文献   

12.
13.
14.
15.
We consider additive codes over GF(4) that are self-dual with respect to the Hermitian trace inner product. Such codes have a well-known interpretation as quantum codes and correspond to isotropic systems. It has also been shown that these codes can be represented as graphs, and that two codes are equivalent if and only if the corresponding graphs are equivalent with respect to local complementation and graph isomorphism. We use these facts to classify all codes of length up to 12, where previously only all codes of length up to 9 were known. We also classify all extremal Type II codes of length 14. Finally, we find that the smallest Type I and Type II codes with trivial automorphism group have length 9 and 12, respectively.  相似文献   

16.
The quaternary Hermitian self-dual [18,9,6]4 codes are classified and used to construct new binary self-dual [54,27,10]2 codes. All self-dual [54,27,10]2 codes obtained have automorphisms of order 3, and six of their weight enumerators have not been previously encountered.   相似文献   

17.
Let Ψn be the number of inequivalent self-dual codes in . We prove that , where . Let Δn be the number of inequivalent doubly even self-dual codes in . We also prove that .  相似文献   

18.
19.
20.
The only example of a binary doubly-even self-dual [120,60,20] code was found in 2005 by Gaborit et al. (IEEE Trans Inform theory 51, 402–407 2005). In this work we present 25 new binary doubly-even self-dual [120,60,20] codes having an automorphism of order 23. Moreover we list 7 self-dual [116,58,18] codes, 30 singly-even self-dual [96,48,16] codes and 20 extremal self-dual [92,46,16] codes. All codes are new and present different weight enumerators.   相似文献   

设为首页 | 免责声明 | 关于勤云 | 加入收藏

Copyright©北京勤云科技发展有限公司  京ICP备09084417号