Institute for Mathematics and Its Applications

Talk abstract:

Linear Perfect Codes and a Characterization of the Classical Designs

Vladimir D. Tonchev, Michigan Technological University

A new definition for the dimension of a combinatorial t-(v, k, $\lambda$) design over a finite field is proposed. The complementary designs of the hyperplanes in a finite projective or affine geometry, and the finite Desarguesian planes in particular, are characterized as the unique (up to isomorphism) designs with the given parameters and minimum dimension. This generalizes a well-known characterization of the binary hyperplane designs in terms of their minimum 2-rank. The proof utilizes the q-ary analogue of the Hamming code, and a group-theoretic characterization of the classical designs.

Back to Workshop Schedule