共查询到20条相似文献,搜索用时 15 毫秒
1.
2.
Huffman (2013) [12] studied -linear codes over and he proved the MacWilliams identity for these codes with respect to ordinary and Hermitian trace inner products. Let S be a finite commutative -algebra. An -linear code over S of length n is an -submodule of . In this paper, we study -linear codes over S. We obtain some bounds on minimum distance of these codes, and some large classes of MDR codes are introduced. We generalize the ordinary and Hermitian trace products over -algebras and we prove the MacWilliams identity with respect to the generalized form. In particular, we obtain Huffman's results on the MacWilliams identity. Among other results, we give a theory to construct a class of quantum codes and the structure of -linear codes over finite commutative graded -algebras. 相似文献
3.
4.
5.
6.
7.
8.
In this paper, by Gauss sums, we determine Hamming weight distributions of generalized quasi-cyclic (GQC) codes over the finite chain ring , where . As applications, some new infinite families of minimal linear codes with and projective two-weight codes are constructed. 相似文献
9.
We consider a generalisation of a conjecture by Patterson and Wiedemann from 1983 on the Hamming distance of a function from to to the set of affine functions from to . We prove the conjecture for each q such that the characteristic of lies in a subset of the primes with density 1 and we prove the conjecture for all q by assuming the generalised Riemann hypothesis. Roughly speaking, we show the existence of functions for which the distance to the affine functions is maximised when n tends to infinity. This also determines the asymptotic behaviour of the covering radius of the Reed-Muller code over and so answers a question raised by Leducq in 2013. Our results extend the case , which was recently proved by the author and which corresponds to the original conjecture by Patterson and Wiedemann. Our proof combines evaluations of Gauss sums in the semiprimitive case, probabilistic arguments, and methods from discrepancy theory. 相似文献
10.
11.
Let be a finite field and a positive integer. In this paper, we find a new combinatorial method to determine weight enumerators of reducible cyclic codes and their dual codes of length over , which just generalize results of Zhu et al. (2015); especially, we also give the weight enumerator of a cyclic code, which is viewed as a partial Melas code. Furthermore, weight enumerators obtained in this paper are all in the form of power of a polynomial. 相似文献
12.
13.
14.
15.
16.
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. 相似文献
17.
18.
19.