AbstractIt is well known that the extended binary Golay [24,12,8] code yields 5-designs. In particular, the supports of all the weight 8 codewords in the code form a Steiner system S(5,8,24). In this paper, we give a construction of mutually disjoint Steiner systems S(5,8,24) by constructing isomorphic Golay codes. As a consequence, we show that there exists at least 22 mutually disjoint Steiner systems S(5,8,24). Finally, we prove that there exists at least 46 mutually disjoint 5-(48,12,8) designs from the extended binary quadratic residue [48,24,12] code
AbstractWe prove that the 5-(24, 12, 48) design formed by the dodecades in the extended binary Golay...
AbstractThere exist 13 mutually disjoint resolutions of the Steiner system S(5, 8, 24). There also e...
AbstractGeneralized Steiner systems GS(2,k,v,g) were first introduced by Etzion and used to construc...
AbstractIt is well known that the extended binary Golay [24,12,8] code yields 5-designs. In particul...
AbstractNew elementary proofs of the uniqueness of certain Steiner systems using coding theory are p...
AbstractKramer and Magliveras constructed simple 5-(24,8,λ) designs for λ⩽9. Betten et al. construct...
AbstractIn this paper we show that no pair of Steiner systems S(5, 8, 24) can intersect in the octad...
AbstractSome combinatorial properties of the Golay binary code are emphasized and used for two main ...
The binary image of an extended cyclic code over F8 relatively to a self-dual basis of F8 is the GOL...
We give a new construction of the extended binary Golay code. The construction is carried out by tak...
AbstractA method is established to convert results from finite geometries to error-correcting codes....
The binary code spanned by the rows of the point by block incidence matrix of a Steiner triple syste...
The binary linear codes generated by incidence matrices of the 80 Steiner triple systems on 15 point...
AbstractWe consider optimal constant weight codes over arbitrary alphabets. Some of these codes are ...
AbstractA t-design λ; t-d-n is a system of subsets of size d (called blocks) from an n-set S, such t...
AbstractWe prove that the 5-(24, 12, 48) design formed by the dodecades in the extended binary Golay...
AbstractThere exist 13 mutually disjoint resolutions of the Steiner system S(5, 8, 24). There also e...
AbstractGeneralized Steiner systems GS(2,k,v,g) were first introduced by Etzion and used to construc...
AbstractIt is well known that the extended binary Golay [24,12,8] code yields 5-designs. In particul...
AbstractNew elementary proofs of the uniqueness of certain Steiner systems using coding theory are p...
AbstractKramer and Magliveras constructed simple 5-(24,8,λ) designs for λ⩽9. Betten et al. construct...
AbstractIn this paper we show that no pair of Steiner systems S(5, 8, 24) can intersect in the octad...
AbstractSome combinatorial properties of the Golay binary code are emphasized and used for two main ...
The binary image of an extended cyclic code over F8 relatively to a self-dual basis of F8 is the GOL...
We give a new construction of the extended binary Golay code. The construction is carried out by tak...
AbstractA method is established to convert results from finite geometries to error-correcting codes....
The binary code spanned by the rows of the point by block incidence matrix of a Steiner triple syste...
The binary linear codes generated by incidence matrices of the 80 Steiner triple systems on 15 point...
AbstractWe consider optimal constant weight codes over arbitrary alphabets. Some of these codes are ...
AbstractA t-design λ; t-d-n is a system of subsets of size d (called blocks) from an n-set S, such t...
AbstractWe prove that the 5-(24, 12, 48) design formed by the dodecades in the extended binary Golay...
AbstractThere exist 13 mutually disjoint resolutions of the Steiner system S(5, 8, 24). There also e...
AbstractGeneralized Steiner systems GS(2,k,v,g) were first introduced by Etzion and used to construc...