Quasi-symmetric 2-(31, 7, 7) designs and a revision of Hamada's conjecture
Journal of Combinatorial Theory Series A
Design theory
Combinatorial configurations, designs, codes, graphs
Combinatorial configurations, designs, codes, graphs
The classification of doubly transitive affine designs
Designs, Codes and Cryptography
Designs and their codes
Graphs, Codes and Designs
A Note on MDS Codes, n-Arcs and Complete Designs
Designs, Codes and Cryptography
Symmetric (4, 4)-nets and generalized Hadamard matrices over groups of order 4
Designs, Codes and Cryptography
On Locally Decodable Codes, Self-correctable Codes, and t-Private PIR
APPROX '07/RANDOM '07 Proceedings of the 10th International Workshop on Approximation and the 11th International Workshop on Randomization, and Combinatorial Optimization. Algorithms and Techniques
Polarities, quasi-symmetric designs, and Hamada's conjecture
Designs, Codes and Cryptography
Weight enumeration of codes from finite spaces
Designs, Codes and Cryptography
Perfect Codes and Balanced Generalized Weighing Matrices
Finite Fields and Their Applications
A Hamada type characterization of the classical geometric designs
Designs, Codes and Cryptography
| Hi-index | 0.00 |
A new definitionfor the dimension of a combinatorial t- (v,k,\lambda)design over a finite field is proposed. The complementary designsof the hyperplanes in a finite projective or affine geometry,and the finite Desarguesian planes in particular, are characterizedas the unique (up to isomorphism) designs with the given parametersand minimum dimension. This generalizes a well-known characterizationof the binary hyperplane designs in terms of their minimum 2-rank.The proof utilizes the q-ary analogue of the Hammingcode, and a group-theoretic characterization of the classicaldesigns.