Let D be a 2-(v, k, 4) symmetric design and G be a flag-transitive point-primitive automorphism group of D with X ≥G ≤Aut(X) where X ≌ PSL2(q).Then D is a 2-(15,8,4) symmetric design with X = PSL2(9) and ...Let D be a 2-(v, k, 4) symmetric design and G be a flag-transitive point-primitive automorphism group of D with X ≥G ≤Aut(X) where X ≌ PSL2(q).Then D is a 2-(15,8,4) symmetric design with X = PSL2(9) and Xx = PGL2(3) where x is a point of D.展开更多
Secret sharing has been a subject of study for over 30 years. The coding theory has been an important role in the constructing of the secret sharing schemes. It is known that every linear code can be used to construct...Secret sharing has been a subject of study for over 30 years. The coding theory has been an important role in the constructing of the secret sharing schemes. It is known that every linear code can be used to construct the secret sharing schemes. Since the code of a symmetric (V, k, λ)-design is a linear code, this study is about the secret sharing schemes based on C of Fp-code C of asymmetric (v, k, λ)-design.展开更多
This paper studies the nonsystematic Low-Density Parity-Check(LDPC)codes based onSymmetric Balanced Incomplete Block Design(SBIBD).First,it is concluded that the performancedegradation of nonsystematic linear block co...This paper studies the nonsystematic Low-Density Parity-Check(LDPC)codes based onSymmetric Balanced Incomplete Block Design(SBIBD).First,it is concluded that the performancedegradation of nonsystematic linear block codes is bounded by the average row weight of generalizedinverses of their generator matrices and code rate.Then a class of nonsystematic LDPC codes con-structed based on SBIBD is presented.Their characteristics include:both generator matrices andparity-check matrices are sparse and cyclic,which are simple to encode and decode;and almost arbi-trary rate codes can be easily constructed,so they are rate-compatible codes.Because there aresparse generalized inverses of generator matrices,the performance of the proposed codes is only0.15dB away from that of the traditional systematic LDPC codes.展开更多
Methods of constructing the optimum chemical balance weighing designs from symmetric balanced incomplete block designs are proposed with illustration. As a by-product pairwise efficiency and variance balanced designs ...Methods of constructing the optimum chemical balance weighing designs from symmetric balanced incomplete block designs are proposed with illustration. As a by-product pairwise efficiency and variance balanced designs are also obtained.展开更多
Properties of symmetrical layers as matching layers in multilayer thin film design were analyzed. A calculation method was presented to derive parameters of desired equivalent refractive index. A harmonic beam splitte...Properties of symmetrical layers as matching layers in multilayer thin film design were analyzed. A calculation method was presented to derive parameters of desired equivalent refractive index. A harmonic beam splitter was designed and fabricated to test this matching method. OCIS codes: 230.1360, 220.0220, 310.6860.展开更多
In this paper using the weight enumerators of a linear [n, k]--code, we give a theorem about minimal codewords. In this n context, we show that while 1 E C if Wmin〉 n/2 in the binary [n, k] --code C, then all of the...In this paper using the weight enumerators of a linear [n, k]--code, we give a theorem about minimal codewords. In this n context, we show that while 1 E C if Wmin〉 n/2 in the binary [n, k] --code C, then all of the nonzero codewords of C are 2 minimal. Therefore, we obtain a corollary.展开更多
Consider the flag-transitive 2-(v, k, λ) symmetric designs with (k, λ)= 1. We prove that if () is a nontrivial 2-(v, k, λ)symmetric design with (k,λ) = 1 and G ≤ Aut() is flag-transitive with Sot(G)...Consider the flag-transitive 2-(v, k, λ) symmetric designs with (k, λ)= 1. We prove that if () is a nontrivial 2-(v, k, λ)symmetric design with (k,λ) = 1 and G ≤ Aut() is flag-transitive with Sot(G) = An for n ≥5, then is the projective space PG2(3, 2) and G = A7.展开更多
Let D be a triplane, i.e., a 2-(ν, k, 3) symmetric design, and G be a subgroup of the full automorphism group of D. In this paper we prove that if G is flag-transitive point-primitive, then the socle of G cannot be a...Let D be a triplane, i.e., a 2-(ν, k, 3) symmetric design, and G be a subgroup of the full automorphism group of D. In this paper we prove that if G is flag-transitive point-primitive, then the socle of G cannot be a sporadic simple group.展开更多
Let D be a nontrivial 2-(v, k, 3) symmetric design (triplane) and let G≤Aut(D) be flag-transitive and point-primitive. In this paper, we prove that if G is an affine group, then G≤AΓL1(q), where q is some power of ...Let D be a nontrivial 2-(v, k, 3) symmetric design (triplane) and let G≤Aut(D) be flag-transitive and point-primitive. In this paper, we prove that if G is an affine group, then G≤AΓL1(q), where q is some power of a prime p and p≥5.展开更多
基金Supported by the National Natural Science Foundation of China(11071081)
文摘Let D be a 2-(v, k, 4) symmetric design and G be a flag-transitive point-primitive automorphism group of D with X ≥G ≤Aut(X) where X ≌ PSL2(q).Then D is a 2-(15,8,4) symmetric design with X = PSL2(9) and Xx = PGL2(3) where x is a point of D.
文摘Secret sharing has been a subject of study for over 30 years. The coding theory has been an important role in the constructing of the secret sharing schemes. It is known that every linear code can be used to construct the secret sharing schemes. Since the code of a symmetric (V, k, λ)-design is a linear code, this study is about the secret sharing schemes based on C of Fp-code C of asymmetric (v, k, λ)-design.
基金the National Natural Science Foundation of China(No.60272009,No.60472045,and No.60496313).
文摘This paper studies the nonsystematic Low-Density Parity-Check(LDPC)codes based onSymmetric Balanced Incomplete Block Design(SBIBD).First,it is concluded that the performancedegradation of nonsystematic linear block codes is bounded by the average row weight of generalizedinverses of their generator matrices and code rate.Then a class of nonsystematic LDPC codes con-structed based on SBIBD is presented.Their characteristics include:both generator matrices andparity-check matrices are sparse and cyclic,which are simple to encode and decode;and almost arbi-trary rate codes can be easily constructed,so they are rate-compatible codes.Because there aresparse generalized inverses of generator matrices,the performance of the proposed codes is only0.15dB away from that of the traditional systematic LDPC codes.
文摘Methods of constructing the optimum chemical balance weighing designs from symmetric balanced incomplete block designs are proposed with illustration. As a by-product pairwise efficiency and variance balanced designs are also obtained.
文摘Properties of symmetrical layers as matching layers in multilayer thin film design were analyzed. A calculation method was presented to derive parameters of desired equivalent refractive index. A harmonic beam splitter was designed and fabricated to test this matching method. OCIS codes: 230.1360, 220.0220, 310.6860.
文摘In this paper using the weight enumerators of a linear [n, k]--code, we give a theorem about minimal codewords. In this n context, we show that while 1 E C if Wmin〉 n/2 in the binary [n, k] --code C, then all of the nonzero codewords of C are 2 minimal. Therefore, we obtain a corollary.
基金Acknowledgements The authors would like to thank the anonymous referees for their valuable suggestions and comments which helped to improve this paper. This work was supported by the National Natural Science Foundation of China (Grant No. 11471123) and the Natural Science Foundation of Guangdong Province (Grant No. $2013010011928).
文摘Consider the flag-transitive 2-(v, k, λ) symmetric designs with (k, λ)= 1. We prove that if () is a nontrivial 2-(v, k, λ)symmetric design with (k,λ) = 1 and G ≤ Aut() is flag-transitive with Sot(G) = An for n ≥5, then is the projective space PG2(3, 2) and G = A7.
基金supported by Scientific Research Foundation for the Returned Overseas Scholars, Ministry of Education of China
文摘Let D be a triplane, i.e., a 2-(ν, k, 3) symmetric design, and G be a subgroup of the full automorphism group of D. In this paper we prove that if G is flag-transitive point-primitive, then the socle of G cannot be a sporadic simple group.
基金supported by National Natural Science Foundation of China (Grant No. 11071081)
文摘Let D be a nontrivial 2-(v, k, 3) symmetric design (triplane) and let G≤Aut(D) be flag-transitive and point-primitive. In this paper, we prove that if G is an affine group, then G≤AΓL1(q), where q is some power of a prime p and p≥5.