AbstractWe construct a family of simple 3-(2m,8,14(2m−8)/3) designs, with odd m⩾5, from all Z4-Goethals-like codes Gk. In addition, these designs imply the existence of other design families with the same parameters as the designs constructed from the Z4-Goethals code G1, i.e. the designs with a block size 7 by Shin, Kumar, and Helleseth and the designs with a block size 8 by Ranto. In the existence proofs we count the number of solutions to certain systems of equations over finite fields and use properties of Dickson and linearized polynomials. Also, the nonequivalence of the designs from different Goethals-like codes is considered
AbstractIn this paper we present a construction of 3-designs by using a 3-design with resolvability....
Combinatorial configurations have significant applications in many areas, such as in the design of e...
AbstractFor every odd prime power q where q ≡ −1(3) we define a (2q + 2, q + 1) code over the field ...
AbstractWe construct a family of simple 3-(2m,8,14(2m−8)/3) designs, with odd m⩾5, from all Z4-Goeth...
Recently, active research has been performed on constructing t-designs from linear codes over Z<SUB>...
We consider t-designs constructed from codewords in the Goethals code G(m) over Z(4). Some new desig...
AbstractWe consider t-designs constructed from codewords in the Goethals code Gm over Z4. Some new d...
AbstractWe consider t-designs constructed from codewords in the Preparata code Pm over Z4. A new app...
AbstractIn this paper we construct an infinite class of 3-designs and one 4-design by means of a gen...
The coding-theoretical interest in combinatorial designs defined by subspaces of a finite geometry w...
Searches for designs and codes may be divided into two broad categories: those which attempt to prov...
AbstractWe give some constructions of new infinite families of group divisible designs, GDD(n,2,4;λ1...
We investigate the existence of 3-designs and uniform large sets of 3-designs with block size 6 admi...
AbstractWe investigate the existence of 3-designs and uniform large sets of 3-designs with block siz...
Quasi-symmetric designs are block designs with two block intersection numbers x and y It is shown th...
AbstractIn this paper we present a construction of 3-designs by using a 3-design with resolvability....
Combinatorial configurations have significant applications in many areas, such as in the design of e...
AbstractFor every odd prime power q where q ≡ −1(3) we define a (2q + 2, q + 1) code over the field ...
AbstractWe construct a family of simple 3-(2m,8,14(2m−8)/3) designs, with odd m⩾5, from all Z4-Goeth...
Recently, active research has been performed on constructing t-designs from linear codes over Z<SUB>...
We consider t-designs constructed from codewords in the Goethals code G(m) over Z(4). Some new desig...
AbstractWe consider t-designs constructed from codewords in the Goethals code Gm over Z4. Some new d...
AbstractWe consider t-designs constructed from codewords in the Preparata code Pm over Z4. A new app...
AbstractIn this paper we construct an infinite class of 3-designs and one 4-design by means of a gen...
The coding-theoretical interest in combinatorial designs defined by subspaces of a finite geometry w...
Searches for designs and codes may be divided into two broad categories: those which attempt to prov...
AbstractWe give some constructions of new infinite families of group divisible designs, GDD(n,2,4;λ1...
We investigate the existence of 3-designs and uniform large sets of 3-designs with block size 6 admi...
AbstractWe investigate the existence of 3-designs and uniform large sets of 3-designs with block siz...
Quasi-symmetric designs are block designs with two block intersection numbers x and y It is shown th...
AbstractIn this paper we present a construction of 3-designs by using a 3-design with resolvability....
Combinatorial configurations have significant applications in many areas, such as in the design of e...
AbstractFor every odd prime power q where q ≡ −1(3) we define a (2q + 2, q + 1) code over the field ...