共查询到20条相似文献,搜索用时 31 毫秒
1.
We introduce an altered version of the four circulant construction over group rings for self-dual codes. We consider this construction over the binary field, the rings and ; using groups of order 4 and 8. Through these constructions and their extensions, we find binary self-dual codes of lengths 16, 32, 48, 64 and 68, many of which are extremal. In particular, we find forty new extremal binary self-dual codes of length 68, including twelve new codes with in , which is the first instance of such a value in the literature. 相似文献
2.
3.
4.
5.
6.
7.
Galois hulls of MDS codes can be applied to construst MDS entanglement-assisted quantum error-correcting codes (EAQECCs). Goppa codes and expurgated Goppa codes (resp., extended Goppa codes) over are GRS codes (resp., extended GRS codes) when . In this paper, we investigate the Galois dual codes of a special kind of Goppa codes and related codes and provide a necessary and sufficient condition for the Galois dual codes of such codes to be Goppa codes and related codes. Then we determine the Galois hulls of the above codes. In particular, we completely characterize Galois LCD, Galois self-orthogonal, Galois dual-containing and Galois self-dual codes among such family of codes. Moreover, we apply the above results to EAQECCs. 相似文献
8.
9.
10.
11.
In this work we give a characterization of Galois Linear Complementary Dual codes and Galois-invariant codes over mixed alphabets of finite chain rings, which leads to the study of the Gray image of -linear codes, where and that provides LCD codes over . 相似文献
12.
In this work, we use the concept of distance between self-dual codes, which generalizes the concept of a neighbor for self-dual codes. Using the k-neighbors, we are able to construct extremal binary self-dual codes of length 68 with new weight enumerators. We construct 143 extremal binary self-dual codes of length 68 with new weight enumerators including 42 codes with in their and 40 with in their . These examples are the first in the literature for these γ values. This completes the theoretical list of possible values for γ in . 相似文献
13.
14.
15.
Entanglement-assisted quantum error-correcting (EAQEC, for short) codes use pre-existing entanglements between the sender and receiver to boost the rate of transmission. It is possible to construct an EAQEC code from any classical linear code, unlike standard quantum error-correcting codes, they can only be constructed from classical linear codes which contain their Hermitian dual codes. However, how to determine the parameters of ebits c in EAQEC codes is not an easy task. In this paper, let p be prime and e, k be integers, we construct six classes of EAQEC codes based on k-Galois dual codes over finite fields , where . The parameter of ebits c of these EAQEC codes can be easily generated algebraically. Furthermore, the six classes of EAQEC codes are of maximal entanglement, most of which have better parameters than current EAQEC codes available. 相似文献
16.
17.
《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 by Construction A. In the process of constructing these codes, we obtain a self-dual code over . In addition, the code implies a code over . These codes have larger minimum weights than the previously known codes and codes, respectively. 相似文献
18.
19.
20.
Sunghyu Han Jon-Lark Kim Heisook Lee Yoonjin Lee 《Finite Fields and Their Applications》2012,18(3):613-633
There is a one-to-one correspondence between ?-quasi-cyclic codes over a finite field and linear codes over a ring . Using this correspondence, we prove that every ?-quasi-cyclic self-dual code of length m? over a finite field can be obtained by the building-up construction, provided that or , m is a prime p, and q is a primitive element of . We determine possible weight enumerators of a binary ?-quasi-cyclic self-dual code of length p? (with p a prime) in terms of divisibility by p. We improve the result of Bonnecaze et al. (2003) [3] by constructing new binary cubic (i.e., ?-quasi-cyclic codes of length 3?) optimal self-dual codes of lengths (Type I), 54 and 66. We also find quasi-cyclic optimal self-dual codes of lengths 40, 50, and 60. When , we obtain a new 8-quasi-cyclic self-dual code over and a new 6-quasi-cyclic self-dual code over . When , we find a new 4-quasi-cyclic self-dual code over and a new 6-quasi-cyclic self-dual code over . 相似文献