Abstract
In 1976, Kramer and Mesner observed that finding a t-design with a given automorphism group can be reduced to solving a matrix problem of the form AX=M, X[i]=0 or I, for all i, I < =i=6 and duplicate the results of Leavitt, Kramer and Magliveras [3,10] in substantially shorter time. Furthermore, a new simple 6-design was found using the algorithm described in this paper
Publication Date
1986
Document Type
Article
Department, Program, or Center
Center for Advancing the Study of CyberInfrastructure
Recommended Citation
D. Kreher, S. Radziszowski. Finding simple t-designs by using basis reduction. Congressus Numerantium, Vol. 55(1986) 235-244.
Campus
RIT – Main Campus
Comments
Note: imported from RIT’s Digital Media Library running on DSpace to RIT Scholar Works in February 2014.