AbstractA formula is found for the total number of distinct Steiner triple systems on 2n−1 points whose 2-rank is one higher than the possible minimum 2n−n−1. The formula can be used for deriving bounds on the number of pairwise nonisomorphic systems for large n, and for the classification of all nonisomorphic systems of small orders. It is proved that the number of nonisomorphic Steiner triple systems on 2n−1 points of 2-rank 2n−n grows exponentially
The main result of this paper is the determination of all pairwise nonisomorphic trade sets of volu...
The binary linear codes generated by incidence matrices of the 80 Steiner triple systems on 15 point...
AbstractWe give the first known examples of 6-sparse Steiner triple systems by constructing 29 such ...
A formula is found for the total number of distinct Steiner triple systems on 2n−1 points whose 2-ra...
AbstractA formula is found for the total number of distinct Steiner triple systems on 2n−1 points wh...
Assmus [1] gave a description of the binary code spanned by the blocks of a Steiner triple or quadru...
By a famous result of Doyen, Hubaut and Vandensavel [6], the 2-rank of a Steiner triple system on 2n...
A computer search over the words of weight 3 in the code of blocks of a classical Steiner triple sys...
AbstractIn this paper, we enumerate the 2-rotational Steiner triple systems of order 25. There are e...
AbstractLet D(v) be the maximum number of pairwise disjoint Steiner triple systems of order v. We pr...
The binary code spanned by the rows of the point by block incidence matrix of a Steiner triple syste...
Using an orderly algorithm, the Steiner triple systems of order 19 are classified; there are 11,084,...
It was proved recently by Jungnickel and Tonchev (2017) that for every integer v=3m−1w , m≥2 , and w...
AbstractIt is shown that there exist exactly three non-isomorphic non-cyclic Steiner triple systems ...
A (Formula presented.) -configuration is a set of (Formula presented.) blocks on (Formula presented....
The main result of this paper is the determination of all pairwise nonisomorphic trade sets of volu...
The binary linear codes generated by incidence matrices of the 80 Steiner triple systems on 15 point...
AbstractWe give the first known examples of 6-sparse Steiner triple systems by constructing 29 such ...
A formula is found for the total number of distinct Steiner triple systems on 2n−1 points whose 2-ra...
AbstractA formula is found for the total number of distinct Steiner triple systems on 2n−1 points wh...
Assmus [1] gave a description of the binary code spanned by the blocks of a Steiner triple or quadru...
By a famous result of Doyen, Hubaut and Vandensavel [6], the 2-rank of a Steiner triple system on 2n...
A computer search over the words of weight 3 in the code of blocks of a classical Steiner triple sys...
AbstractIn this paper, we enumerate the 2-rotational Steiner triple systems of order 25. There are e...
AbstractLet D(v) be the maximum number of pairwise disjoint Steiner triple systems of order v. We pr...
The binary code spanned by the rows of the point by block incidence matrix of a Steiner triple syste...
Using an orderly algorithm, the Steiner triple systems of order 19 are classified; there are 11,084,...
It was proved recently by Jungnickel and Tonchev (2017) that for every integer v=3m−1w , m≥2 , and w...
AbstractIt is shown that there exist exactly three non-isomorphic non-cyclic Steiner triple systems ...
A (Formula presented.) -configuration is a set of (Formula presented.) blocks on (Formula presented....
The main result of this paper is the determination of all pairwise nonisomorphic trade sets of volu...
The binary linear codes generated by incidence matrices of the 80 Steiner triple systems on 15 point...
AbstractWe give the first known examples of 6-sparse Steiner triple systems by constructing 29 such ...