共查询到20条相似文献,搜索用时 15 毫秒
1.
2.
The purpose of this paper is to study codes over finite principal ideal rings. To do this, we begin with codes over finite
chain rings as a natural generalization of codes over Galois rings GR(p
e
, l) (including ). We give sufficient conditions on the existence of MDS codes over finite chain rings and on the existence of self-dual codes
over finite chain rings. We also construct MDS self-dual codes over Galois rings GF(2
e
, l) of length n = 2
l
for any a ≥ 1 and l ≥ 2. Torsion codes over residue fields of finite chain rings are introduced, and some of their properties are derived. Finally,
we describe MDS codes and self-dual codes over finite principal ideal rings by examining codes over their component chain
rings, via a generalized Chinese remainder theorem.
相似文献
3.
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. 相似文献
4.
5.
6.
《Discrete Mathematics》2023,346(1):113167
Galois inner product is a generalization of the Euclidean inner product and Hermitian inner product. The theory on linear codes under Galois inner product can be applied in the constructions of MDS codes and quantum error-correcting codes. In this paper, we construct Galois self-dual codes and MDS Galois self-dual codes from extensions of constacyclic codes. First, we explicitly determine all the Type II splittings leading to all the Type II duadic constacyclic codes in two cases. Second, we propose methods to extend two classes of constacyclic codes to obtain Galois self-dual codes, and we also provide existence conditions of Galois self-dual codes which are extensions of constacyclic codes. Finally, we construct some (almost) MDS Galois self-dual codes using the above results. Some Galois self-dual codes and (almost) MDS Galois self-dual codes obtained in this paper turn out to be new. 相似文献
7.
Let be the Galois ring of characteristic and cardinality . Firstly, we give all primitive idempotent generators of irreducible cyclic codes of length over , and a -adic integer ring with . Secondly, we obtain all primitive idempotents of all irreducible cyclic codes of length over , where and are three primes with , , and . Finally, as applications, weight distributions of all irreducible cyclic codes for and generator polynomials of self-dual cyclic codes of length and over are given. 相似文献
8.
In this paper, we obtain some new results on the existence of MDS self-dual codes utilizing (extended) generalized Reed-Solomon codes over finite fields of odd characteristic. For finite field with odd characteristic and square cardinality, our results can produce more classes of MDS self-dual codes than previous works. 相似文献
9.
MDS self-dual codes over finite fields have attracted a lot of attention in recent years by their theoretical interests in coding theory and applications in cryptography and combinatorics. In this paper we present a series of MDS self-dual codes with new length by using generalized Reed-Solomon codes and extended generalized Reed-Solomon codes as the candidates of MDS codes and taking their evaluation sets as a union of cyclotomic classes. The conditions on such MDS codes being self-dual are expressed in terms of cyclotomic numbers. 相似文献
10.
In this paper we give the structure of constacyclic codes over formal power series and chain rings. We also present necessary and sufficient conditions on the existence of MDS codes over principal ideal rings. These results allow for the construction of infinite families of MDS self-dual codes over finite chain rings, formal power series and principal ideal rings. We also define the Reed–Solomon codes over principal ideal rings. 相似文献
12.
14.
In this paper, is a finite chain ring with residue field and is a unit in By assuming that the multiplicative order of is coprime to we give the trace-representation of any simple-root -constacyclic code over of length and on the other hand show that any cyclic code over of length is a direct sum of trace-representable cyclic codes. Finally, we characterize the simple-root, contractable and cyclic codes over of length into -constacyclic codes of length 相似文献
15.
In this paper, we generalize the linear complementary dual codes (LCD codes for short) to k-Galois LCD codes, and study them by a uniform method. A necessary and sufficient condition for linear codes to be k-Galois LCD codes is obtained, two classes of k-Galois LCD MDS codes are exhibited. Then, necessary and sufficient conditions for λ-constacyclic codes being k-Galois LCD codes are characterized. Some classes of k-Galois LCD λ-constacyclic MDS codes are constructed. Finally, we study Hermitian LCD λ-constacyclic codes, and present a class of Hermitian LCD λ-constacyclic MDS codes. 相似文献
17.
19.