共查询到20条相似文献,搜索用时 0 毫秒
1.
2.
Hai Q. Dinh Xiaoqiang Wang Hongwei Liu Songsak Sriboonchitta 《Discrete Mathematics》2019,342(11):3062-3078
Let be an odd prime, and be a nonzero element of the finite field . The -constacyclic codes of length over are classified as the ideals of quotient ring in terms of their generator polynomials. Based on these generator polynomials, the symbol-pair distances of all such -constacyclic codes of length are obtained in this paper. As an application, all MDS symbol-pair constacyclic codes of length over are established, which produce many new MDS symbol-pair codes with good parameters. 相似文献
3.
4.
5.
6.
8.
10.
11.
Generalizing even-like duadic cyclic codes and Type-II duadic negacyclic codes, we introduce even-like (i.e., Type-II) and odd-like duadic constacyclic codes, and study their properties and existence. We show that even-like duadic constacyclic codes are isometrically orthogonal, and the duals of even-like duadic constacyclic codes are odd-like duadic constacyclic codes. We exhibit necessary and sufficient conditions for the existence of even-like duadic constacyclic codes. A class of even-like duadic constacyclic codes which are alternant MDS-codes is constructed. 相似文献
12.
《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. 相似文献
13.
《Discrete Mathematics》2023,346(7):113391
Symbol-pair codes are proposed to guard against pair-errors in symbol-pair read channels. The minimum symbol-pair distance is of significance in determining the error-correcting capability of a symbol-pair code. One of the central themes in symbol-pair coding theory is the constructions of symbol-pair codes with the largest possible minimum symbol-pair distance. Maximum distance separable (MDS) and almost maximum distance separable (AMDS) symbol-pair codes are optimal and sub-optimal regarding the Singleton bound, respectively. In this paper, six new classes of AMDS symbol-pair codes are explicitly constructed through repeated-root cyclic codes. Remarkably, one class of such codes has unbounded lengths and the minimum symbol-pair distance of another class can reach 13. 相似文献
14.
16.
C.A. Castillo-Guillén C. Rentería-Márquez H. Tapia-Recillas 《Discrete Mathematics》2018,341(4):919-933
Duals of constacyclic codes over a finite local Frobenius non-chain ring of length 4, the length of which is relatively prime to the characteristic of the residue field of the ring are determined. Generators for the dual code are obtained from those of the original constacyclic code. In some cases self-dual codes are determined. 相似文献
17.
In light of the generator polynomials of constacyclic codes over finite chain rings, the depth spectrum of constacyclic codes can be determined if (n,p)=1. 相似文献
18.
19.