Abstract
A generalized incidence matrix of a design over GF(q) is any matrix obtained from the (0, 1)-incidence matrix by replacing ones with nonzero elements from GF(q). The dimension d q of a design D over GF(q) is defined as the minimum value of the q-rank of a generalized incidence matrix of D. It is proved that the dimension d q of the complete design on n points having as blocks all w-subsets, is greater that or equal to n − w + 1, and the equality d q = n − w + 1 holds if and only if there exists an [n, n − w + 1, w] MDS code over GF(q), or equivalently, an n-arc in PG(w − 2, q).
This is a preview of subscription content, log in via an institution to check access.
Similar content being viewed by others
References
T. Beth, D. Jungnickel and H. Lenz, Design Theory, 2nd ed., Cambridge University Press, Cambridge (1999).
J. W. P. Hirschfeld and L. Storme, The packing problem in statistics, coding theory and finite projective spaces, J. Statistical Planning and Inference, Vol. 72 (1998) pp. 355–380.
F. J. MacWilliams and N. J. A. Sloane, The Theory of Error-Correcting Codes, North-Holland, Amsterdam (1977).
V. S. Pless and W. C. Huffman (eds.), Handbook of Coding Theory, North Holland, Amsterdam (1998).
J. A. Thas, Projective geometry over a finite field. In (F. Buekenhout, ed.), Handbook of Incidence Geometry, Chapter 7, Elsevier Science B.V., Amsterdam (1995) pp. 295–347.
V. D. Tonchev, Linear perfect codes and a characterization of the classical designs, Designs, Codes and Cryptography, Vol. 17 (1999) pp. 121–128.