首页 | 本学科首页   官方微博 | 高级检索  
相似文献
 共查询到20条相似文献,搜索用时 15 毫秒
1.
In this paper, a necessary and sufficient condition for the homogeneous distance on an arbitrary finite commutative principal ideal ring to be a metric is obtained. We completely characterize the lower bound of homogeneous distances of matrix product codes over any finite principal ideal ring where the homogeneous distance is a metric. Furthermore, the minimum homogeneous distances of the duals of such codes are also explicitly investigated.  相似文献   

2.
Properties of matrix product codes over finite commutative Frobenius rings are investigated. The minimum distance of matrix product codes constructed with several types of matrices is bounded in different ways. The duals of matrix product codes are also explicitly described in terms of matrix product codes.  相似文献   

3.
In this article, the Rosenbloom-Tsfasman metric of matrix product codes over finite commutative rings is studied and the lower bounds for the minimal Rosenbloom-Tsfasman distances of the matrix product codes are obtained. The lower bounds of the dual codes of matrix product codes over finite commutative Frobenius rings are also given.  相似文献   

4.
Relative one-weight linear codes were introduced by Liu and Chen over finite fields. These codes can be defined just as simply for egalitarian and homogeneous weights over Frobenius bimodule alphabets. A key lemma helps describe the structure of relative one-weight codes, and certain known types of two-weight linear codes can then be constructed easily. The key lemma also provides another approach to the MacWilliams extension theorem.  相似文献   

5.
6.
A greedy 1-subcode is a one-dimensional subcode of minimum (support) weight. A greedy r-subcode is an r-dimensional subcode with minimum support weight under the constraint that it contain a greedy (r - 1)-subcode. The r-th greedy weight e r is the support weight of a greedy r-subcode. The greedy weights are related to the weight hierarchy. We use recent results on the weight hierarchy of product codes to develop a lower bound on the greedy weights of product codes.  相似文献   

7.
We determine the possible homogeneous weights of regular projective two-weight codes over \(\mathbb {Z}_{2^k}\) of length \(n>3\), with dual Krotov distance \(d^{\lozenge }\) at least four. The determination of the weights is based on parameter restrictions for strongly regular graphs applied to the coset graph of the dual code. When \(k=2\), we characterize the parameters of such codes as those of the inverse Gray images of \(\mathbb {Z}_4\)-linear Hadamard codes, which have been characterized by their types by several authors.  相似文献   

8.
In this paper1, we prove existence of optimal complementary dual codes (LCD codes) over large finite fields. We also give methods to generate orthogonal matrices over finite fields and then apply them to construct LCD codes. Construction methods include random sampling in the orthogonal group, code extension, matrix product codes and projection over a self-dual basis.  相似文献   

9.
In this paper, we discuss a kind of Hermitian inner product — symplectic inner product, which is different from the original inner product — Euclidean inner product. According to the definition of symplectic inner product, the codes under the symplectic inner product have better properties than those under the general Hermitian inner product. Here we present the necessary and sufficient condition for judging whether a linear code C over Fp with a generator matrix in the standard form is a symplectic self-dual code. In addition, we give a method for constructing a new symplectic self-dual codes over Fp, which is simpler than others.  相似文献   

10.
In this text we develop some aspects of Harder–Narasimhan theory, slopes, semistability and canonical filtration, in the setting of combinatorial lattices. Of noticeable importance is the Harder–Narasimhan structure associated to a Galois connection between two lattices. It applies, in particular, to matroids.We then specialize this to linear codes. This could be done from at least three different approaches: using the sphere-packing analogy, or the geometric view, or the Galois connection construction just introduced. A remarkable fact is that these all lead to the same notion of semistability and canonical filtration. Relations to previous propositions toward a classification of codes, and to Wei's generalized Hamming weight hierarchy, are also discussed.Last, we study the two important questions of the preservation of semistability (or more generally the behavior of slopes) under duality, and under tensor product. The former essentially follows from Wei's duality theorem for higher weights—and its matroid version—which we revisit in an appendix, developing analogues of the Riemann–Roch, Serre duality, Clifford, and gap and gonality sequence theorems. Likewise the latter is closely related to the bound on higher weights of a tensor product, conjectured by Wei and Yang, and proved by Schaathun in the geometric language, which we reformulate directly in terms of codes. From this material we then derive semistability of tensor product.  相似文献   

11.
In this paper we look at linear codes over the Galois ring $GR(p^{\ell}, m)$ with the homogeneous weight and we prove that the number of codewords with homogenous weights in a particular residue class modulo p e are divisible by high powers of p. We also state a result for a more generalized weight on linear codes over Galois rings. We obtain similar results for the Lee weights of linear codes over $\mathbb{F}_{2^m}+u\mathbb{F}_{2^m}$ and we prove that the results we obtain are best possible. The results that we obtain are an improvement to Wilson’s results in [Wilson RM (2003) In: Proceedings of international workshop on Cambridge linear algebra and graph coloring]  相似文献   

12.
Recently, linear codes with few weights have been studied extensively. These linear codes have wide applications in secret sharing schemes and authentication codes. In this paper, we introduce a new construction of defining sets using cyclotomic mappings and construct three new classes of binary linear codes with two or three weights. We also explicitly determine the weight distributions of these codes.  相似文献   

13.
14.
Let R be a chain ring with four elements. In this paper, we present two new constructions of R-linear codes that contain a subcode associated with a simplex code over the ring R. The simplex codes are defined as the codes generated by a matrix having as columns the homogeneous coordinates of all points in some projective Hjelmslev geometry PHG(R k ). The first construction generalizes a recent result by Kiermaier and Zwanzger to codes of arbitrary dimension. We provide a geometric interpretation of their construction which is then extended to projective Hjelmslev spaces of arbitrary dimension. The second construction exploits the possibility of adding two non-free rows to the generator matrix of a linear code over R associated with a given point set. Though the construction works over both chain rings with four elements, the better codes are obtained for ${R=\mathbb{Z}_4}$ .  相似文献   

15.
A method for demonstrating and enumerating uniformly efficient (permutation-optimal) trellis decoders for self-dual codes of high minimum distance is developed. Such decoders and corresponding permutations are known for relatively few codes.The task of finding such permutations is shown to be substantially simplifiable in the case of self-dual codes in general, and for self-dual codes of sufficiently high minimum distance it is shown that it is frequently possible to deduce the existence of these permutations directly from the parameters of the code.A new and tighter link between generalized Hamming weights and trellis representations is demonstrated: for some self-dual codes, knowledge of one of the generalized Hamming weights is sufficient to determine the entire optimal state complexity profile.These results are used to characterize the permutation-optimal trellises and generalized Hamming weights for all [32,16,8] binary self-dual codes and for several other codes. The numbers of uniformly efficient permutations for several codes, including the [24,12,8] Golay code and both [24,12,9] ternary self-dual codes, are found.  相似文献   

16.
We show that the number of rational points of a subgroup inside a toric variety over a finite field defined by a homogeneous lattice ideal can be computed via Smith normal form of the matrix whose columns constitute a basis of the lattice. This generalizes and yields a concise toric geometric proof of the same fact proven purely algebraically by Lopez and Villarreal for the case of a projective space and a standard homogeneous lattice ideal of dimension one. We also prove a Nullstellensatz type theorem over a finite field establishing a one to one correspondence between subgroups of the dense split torus and certain homogeneous lattice ideals. As application, we compute the main parameters of generalized toric codes on subgroups of the torus of Hirzebruch surfaces, generalizing the existing literature.  相似文献   

17.
令n 为qm -1 的正因子. 本文主要借助特征标、分圆类及Gauss 周期的知识确定了GF(q) 上码长为n、维数为m 的不可约循环码在一些特殊情形下的权重分布, 这些不可约循环码为二权、三权或是四权码.  相似文献   

18.
Linear homogeneous difference systems of equations on an infinite interval are considered. Conditions are given which allow to represent a fundamental solution as a product of two square matrices. The product is made of a diagonal matrix and a matrix which is a perturbation of the identity. The diagonal matrix being on the left in the proposed product rather than on the right as it has been traditionally represented. A self contained theorem of asymptotic approximation is provided which is applied to a special family of difference systems. A theorem, utilizing a linear transformation, which is best possible in a certain sense, is also given.  相似文献   

19.
通过定义δ(xi,yi)函数,把2元非线性2-重量码(n,2,ω1,ω2)的性质推广到q元非线性2-重量码(n,2,ω1,ω2)上,根据码的距离分布和对偶距离分布讨论了码C的不可检错概率.给出了码C不是最佳检错码的几个条件.  相似文献   

20.
It is well known that the problem of determining the weight distributions of families of cyclic codes is, in general, notoriously difficult. An even harder problem is to find characterizations of families of cyclic codes in terms of their weight distributions. On the other hand, it is also well known that cyclic codes with few weights have a great practical importance in coding theory and cryptography. In particular, cyclic codes having three nonzero weights have been studied by several authors, however, most of these efforts focused on cyclic codes over a prime field. In this work we present a characterization of a class of optimal three-weight cyclic codes of dimension 3 over any finite field.  相似文献   

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

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