首页 | 本学科首页   官方微博 | 高级检索  
相似文献
 共查询到20条相似文献,搜索用时 328 毫秒
1.
2.
3.
4.
《Discrete Mathematics》2024,347(1):113662
According to the well-known CSS construction, constructing quantum MDS codes are extensively investigated via Hermitian self-orthogonal generalized Reed-Solomon (GRS) codes. In this paper, given two Hermitian self-orthogonal GRS codes GRSk1(A,vA) and GRSk2(B,vB), we propose a sufficient condition to ensure that GRSk(AB,vAB) is still a Hermitian self-orthogonal code. Consequently, we first present a new general construction of infinitely families of quantum MDS codes from known ones. Moreover, applying the trace function and norm function over finite fields, we give another two new constructions of quantum MDS codes with flexible parameters. It turns out that the forms of the lengths of our quantum MDS codes are quite different from previous known results in the literature. Meanwhile, the minimum distances of all the q-ary quantum MDS codes are bigger than q/2+1.  相似文献   

5.
I. Hambleton, L. Taylor and B. Williams conjectured a general formula in the spirit of H. Lenstra for the decomposition of Gn(RG) for any finite group G and noetherian ring R. The conjectured decomposition was shown to hold for some large classes of finite groups. D. Webb and D. Yao discovered that the conjecture failed for the symmetric group S5, but remarked that it still might be reasonable to expect the HTW-decomposition for solvable groups. In this paper we show that the solvable group SL(2,F3) is also a counterexample to the conjectured HTW-decomposition. Nevertheless, we prove that for any finite group G the rank of G1(ZG) does not exceed the rank of the expression in the HTW-decomposition. We also show that the HTW-decomposition predicts correct torsion for G1(ZG) for any finite group G. Furthermore, we prove that for any degree other than n=1 the conjecture gives a correct prediction for the rank of Gn(ZG).  相似文献   

6.
7.
《Discrete Mathematics》2022,345(8):112903
Graphs considered in this paper are finite, undirected and loopless, but we allow multiple edges. The point partition number χt(G) is the least integer k for which G admits a coloring with k colors such that each color class induces a (t?1)-degenerate subgraph of G. So χ1 is the chromatic number and χ2 is the point arboricity. The point partition number χt with t1 was introduced by Lick and White. A graph G is called χt-critical if every proper subgraph H of G satisfies χt(H)<χt(G). In this paper we prove that if G is a χt-critical graph whose order satisfies |G|2χt(G)?2, then G can be obtained from two non-empty disjoint subgraphs G1 and G2 by adding t edges between any pair u,v of vertices with uV(G1) and vV(G2). Based on this result we establish the minimum number of edges possible in a χt-critical graph G of order n and with χt(G)=k, provided that n2k?1 and t is even. For t=1 the corresponding two results were obtained in 1963 by Tibor Gallai.  相似文献   

8.
《Discrete Mathematics》2022,345(10):113004
Let G be a graph. We say that G is perfectly divisible if for each induced subgraph H of G, V(H) can be partitioned into A and B such that H[A] is perfect and ω(H[B])<ω(H). We use Pt and Ct to denote a path and a cycle on t vertices, respectively. For two disjoint graphs F1 and F2, we use F1F2 to denote the graph with vertex set V(F1)V(F2) and edge set E(F1)E(F2), and use F1+F2 to denote the graph with vertex set V(F1)V(F2) and edge set E(F1)E(F2){xy|xV(F1) and yV(F2)}. In this paper, we prove that (i) (P5,C5,K2,3)-free graphs are perfectly divisible, (ii) χ(G)2ω2(G)?ω(G)?3 if G is (P5,K2,3)-free with ω(G)2, (iii) χ(G)32(ω2(G)?ω(G)) if G is (P5,K1+2K2)-free, and (iv) χ(G)3ω(G)+11 if G is (P5,K1+(K1K3))-free.  相似文献   

9.
10.
《Discrete Mathematics》2022,345(11):113059
Let Fq be the finite field of q elements and let D2n=x,y|xn=1,y2=1,yxy=xn?1 be the dihedral group of 2n elements. Left ideals of the group algebra Fq[D2n] are known as left dihedral codes over Fq of length 2n, and abbreviated as left D2n-codes. Let gcd(n,q)=1. In this paper, we give an explicit representation for the Euclidean hull of every left D2n-code over Fq. On this basis, we determine all distinct Euclidean LCD codes and Euclidean self-orthogonal codes which are left D2n-codes over Fq. In particular, we provide an explicit representation and a precise enumeration for these two subclasses of left D2n-codes and self-dual left D2n-codes, respectively. Moreover, we give a direct and simple method for determining the encoder (generator matrix) of any left D2n-code over Fq, and present several numerical examples to illustrative our applications.  相似文献   

11.
12.
13.
There are many Noetherian-like rings. Among them, we are interested in SFT-rings, piecewise Noetherian rings, and rings with Noetherian prime spectrum. Some of them are stable under polynomial extensions but none of them are stable under power series extensions. We give partial answers to some open questions related with stabilities of such rings. In particular, we show that any mixed extensions R[X1??[Xn? over a zero-dimensional SFT ring R are also SFT-rings, and that if R is an SFT-domain such that R/P is integrally closed for each prime ideal P of R, then R[X] is an SFT-ring. We also give a direct proof that if R is an SFT Prüfer domain, then R[X1,?,Xn] is an SFT-ring. Finally, we show that the power series extension R?X? over a Prüfer domain R is piecewise Noetherian if and only if R is Noetherian.  相似文献   

14.
15.
Let R be a commutative Noetherian ring of dimension two with 1/2R and let A=R[X1,?,Xn]. Let P be a projective A-module of rank 2. In this article, we prove that P is cancellative if 2(P)A is cancellative.  相似文献   

16.
17.
18.
《Discrete Mathematics》2022,345(5):112759
  相似文献   

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

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