Enumeration of t-Designs Through Intersection Matrices

نویسندگان

  • Ziba Eslami
  • Gholamreza B. Khosrovshahi
  • M. Mohammad-Noori
چکیده

In this paper, we exploit some intersection matrices to empower a backtracking approach based on Kramer–Mesner matrices. As an application, we consider the interesting family of simple t-ðtþ 8; tþ 2; 4Þ designs, 1 t 4, and provide a complete classification for t 1⁄4 1; 4, as well as a classification of all non-rigid designs for t 1⁄4 2; 3. We also enumerate all rigid designs for t 1⁄4 2. The computations confirm the results obtained in Denny and Mathon [4] through the new approach which is much simpler. Finally a list of other designs constructed by this method is provided.

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

Intersection Matrices Revisited

Several intersection matrices of s-subsets versus k-subsets of a v-set are introduced in the literature. We study these matrices systematically through counting arguments and generating function techniques. A number of new or known identities appear as natural consequences of this viewpoint; especially, use of the derivative operator d/dz and some related operators reveals some connections betw...

متن کامل

Classification of 6-(14,7,4) designs with nontrivial automorphism groups

In this paper, we introduce some intersection matrices for t-designs. Using these matrices together with a modified version of a backtracking algorithm we classify all 6-(14,7,4) and 5-(13,6,4) designs with nontrivial automorphism groups and obtain 13 and 21 such designs, respectively.

متن کامل

COMPUTATIONAL ENUMERATION OF POINT DEFECT CLUSTERS IN DOUBLE- LATTICE CRYSTALS

The cluster representation matrices have already been successfully used to enumerate close-packed vacancy clusters in all single-lattice crystals [I, 2]. Point defect clusters in double-lattice crystals may have identical geometry but are distinct due to unique atomic postions enclosing them. The method of representation matrices is extended to make it applicable to represent and enumerate ...

متن کامل

Some Optimal Codes From Designs

The binary and ternary codes spanned by the rows of the point by block incidence matrices of some 2-designs and their complementary and orthogonal designs are studied. A new method is also introduced to study optimal codes.

متن کامل

Intersection theorems and mod p rank of inclusion matrices

Higher incidence matrices have proved an important tool both in design theory and extremal set theory. In the present paper some tight bounds on the rank over finite fields of some inclusion matrices are derived. In particular, a short proof of Wilson's mod p rank formula is given. A problem of Graham, Li, and Li concerning bases for so-called null t-designs is solved as well.

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

عنوان ژورنال:
  • Des. Codes Cryptography

دوره 32  شماره 

صفحات  -

تاریخ انتشار 2004