Title
Linear perfect codes and a characterization of the classical designs
Document Type
Article
Publication Date
9-1999
Abstract
A new definition for the dimension of a combinatorial t-(v,k,λ) 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.
Publication Title
Designs, Codes and Cryptography
Recommended Citation
Tonchev, V.
(1999).
Linear perfect codes and a characterization of the classical designs.
Designs, Codes and Cryptography,
17(1-3), 121-128.
http://doi.org/10.1023/A:1008314923487
Retrieved from: https://digitalcommons.mtu.edu/math-fp/144
Publisher's Statement
© Kluwer Academic Publishers 1999. Publisher’s version of record: https://doi.org/10.1023/A:1008314923487