共查询到20条相似文献,搜索用时 62 毫秒
1.
2.
Masaaki Harada 《Discrete Mathematics》2017,340(10):2466-2468
In this note, we demonstrate that every binary doubly even self-dual code of length can be realized as the residue code of some extremal Type II -code. As a consequence, it is shown that there are at least inequivalent extremal Type II -codes of length . 相似文献
4.
Let be a finite field of odd order and , where are positive integers, are distinct odd primes and . In this paper, we study the irreducible factorization of over and all primitive idempotents in the ring .Moreover, we obtain the dimensions and the minimum Hamming distances of all irreducible cyclic codes of length over . 相似文献
5.
An index , length quasi-cyclic code can be viewed as a cyclic code of length over the field via a basis of the extension . However, this cyclic code is only linear over , making it an additive cyclic code, or an -linear cyclic code, over the alphabet . This approach was recently used in Shi et al. (2017) [16] to study a class of quasi-cyclic codes, and more importantly in Shi et al. (2017) [17] to settle a long-standing question on the asymptotic performance of cyclic codes. Here, we answer one of the problems posed in these two articles, and characterize those quasi-cyclic codes which have -linear cyclic images under a basis of the extension . Our characterizations are based on the module structure of quasi-cyclic codes, as well as on their CRT decompositions into constituents. In the case of a polynomial basis, we characterize the constituents by using the theory of invariant subspaces of operators. We also observe that analogous results extend to the case of quasi-twisted codes. 相似文献
6.
7.
8.
9.
10.
11.
12.
《Discrete Mathematics》2022,345(11):113059
Let be the finite field of q elements and let be the dihedral group of 2n elements. Left ideals of the group algebra are known as left dihedral codes over of length 2n, and abbreviated as left -codes. Let . In this paper, we give an explicit representation for the Euclidean hull of every left -code over . On this basis, we determine all distinct Euclidean LCD codes and Euclidean self-orthogonal codes which are left -codes over . In particular, we provide an explicit representation and a precise enumeration for these two subclasses of left -codes and self-dual left -codes, respectively. Moreover, we give a direct and simple method for determining the encoder (generator matrix) of any left -code over , and present several numerical examples to illustrative our applications. 相似文献
13.
14.
15.
16.
17.
Let q be a power of an odd prime. We prove that all -quadratic perfect nonlinear maps from to are equivalent. We also give a geometric method to find the corresponding equivalence explicitly. 相似文献
18.
It is known that each positive definite quasi-Cartan matrix is -equivalent to a Cartan matrix called Dynkin type of , the matrix is uniquely determined up to conjugation by permutation matrices. However, in most of the cases, it is not possible to determine the Dynkin type of a given connected quasi-Cartan matrix by simple inspection. In this paper, we give a graph theoretical characterization of non-symmetric connected quasi-Cartan matrices. For this purpose, a special assemblage of blocks is introduced. This result complements the approach proposed by Barot (1999, 2001), for , and with . 相似文献
19.