AbstractRahilly [On the line structure of designs, Discrete Math. 92 (1991) 291–303] described a construction that relates any Hadamard design H on 4m-1 points with a line spread to an affine design having the same parameters as the classical design of points and hyperplanes in AG(m,4). Here it is proved that the affine design is the classical design of points and hyperplanes in AG(m,4) if, and only if, H is the classical design of points and hyperplanes in PG(2m-1,2) and the line spread is of a special type. Computational results about line spreads in PG(5,2) are given. One of the affine designs obtained has the same 2-rank as the design of points and planes in AG(3,4), and provides a counter-example to a conjecture of Hamada [On the p-ran...
A bound on the 2-rank of an affine designs obtained from a Hadamard design with a line spread via Ra...
We introduce the notion of an extension set for an affine plane of order q to study affine designs D...
The dimension of a combinatorial design D over a finite field F = GF(q) was defined in (Tonchev, Des...
Rahilly [On the line structure of designs, Discrete Math. 92 (1991) 291–303] described a constructio...
Rahilly [On the line structure of designs, Discrete Math. 92 (1991) 291–303] described a constructio...
AbstractRahilly [On the line structure of designs, Discrete Math. 92 (1991) 291–303] described a con...
Rahilly [On the line structure of designs, Discrete Math. 92 (1991) 291–303] described a constructio...
AbstractA line of a design is the intersection of all the blocks on two points. There is an upper bo...
AbstractAll Hadamard 2-(63,31,15) designs invariant under the dihedral group of order 10 are constru...
A line of a design is the intersection of all the blocks on two points. There is an upper bound on t...
AbstractA line of a design is the intersection of all the blocks on two points. There is an upper bo...
AbstractIt is known that the designs PGn-1(n,q) in some cases have spreads of maximal α-arcs. Here a...
AbstractThe important role of Hadamard designs for applications in several fields has been long esta...
AbstractIn a recent paper, two of the authors used polarities in PG(2d−1,p) (p⩾2 prime, d⩾2) to cons...
AbstractEvery (t + 1)-design B satisfies (+) If T is a set of t points, and B a block of B then the ...
A bound on the 2-rank of an affine designs obtained from a Hadamard design with a line spread via Ra...
We introduce the notion of an extension set for an affine plane of order q to study affine designs D...
The dimension of a combinatorial design D over a finite field F = GF(q) was defined in (Tonchev, Des...
Rahilly [On the line structure of designs, Discrete Math. 92 (1991) 291–303] described a constructio...
Rahilly [On the line structure of designs, Discrete Math. 92 (1991) 291–303] described a constructio...
AbstractRahilly [On the line structure of designs, Discrete Math. 92 (1991) 291–303] described a con...
Rahilly [On the line structure of designs, Discrete Math. 92 (1991) 291–303] described a constructio...
AbstractA line of a design is the intersection of all the blocks on two points. There is an upper bo...
AbstractAll Hadamard 2-(63,31,15) designs invariant under the dihedral group of order 10 are constru...
A line of a design is the intersection of all the blocks on two points. There is an upper bound on t...
AbstractA line of a design is the intersection of all the blocks on two points. There is an upper bo...
AbstractIt is known that the designs PGn-1(n,q) in some cases have spreads of maximal α-arcs. Here a...
AbstractThe important role of Hadamard designs for applications in several fields has been long esta...
AbstractIn a recent paper, two of the authors used polarities in PG(2d−1,p) (p⩾2 prime, d⩾2) to cons...
AbstractEvery (t + 1)-design B satisfies (+) If T is a set of t points, and B a block of B then the ...
A bound on the 2-rank of an affine designs obtained from a Hadamard design with a line spread via Ra...
We introduce the notion of an extension set for an affine plane of order q to study affine designs D...
The dimension of a combinatorial design D over a finite field F = GF(q) was defined in (Tonchev, Des...