Abstract
It is proved that a quasi-symmetric design with theSymmetric Difference Property (SDP) is uniquely embeddable as a derived or a residual design into a symmetric SDP design. Alternatively, any quasi-symmetric SDP design is characterized as the design formed by the minimum weight vectors in a binary code spanned by the simplex code and the incidence vector of a point set in PG(2m-1, 2) that intersects every hyperplane in one of two prescribed numbers of points. Applications of these results for the classification of point sets in PG(2m-1, 2) with the same intersection properties as an elliptic or a hyperbolic quadric, as well as the classification of codes achieving the Grey-Rankin bound are discussed.
Similar content being viewed by others
References
Beth, Th., Jungnickel, D. and Lenz, H.,Design Theory, Cambridge University Press, 1986.
Calderbank, R. and Kantor, W. M., ‘The geometry of two-weight codes’,Bull. London Math. Soc. 18 (1986), 97–122.
Cameron, P. J. and van Lint, J. H.,Graphs, Codes and Designs, Cambridge University Press, Cambridge 1980.
Dillon, J. F. and Schatz, J. R., ‘Block designs with the symmetric difference property’, inProc. NSA Mathematical Sciences Meetings (R.L. Ward, ed.), U.S. Govt. Printing Office, Washington, DC, 1987, pp. 159–164.
Dodunekov, S. M., Encheva, S. B. and Kapralov, S. N., ‘On the [28, 7, 12] binary self-complementary codes and their residuals,Designs, Codes and Cryptography (to appear).
Hamada, N. and Ohmori, H., ‘On theBIB design having minimump-rank’,J. Combin. Theory A 18 (1975), 131–140.
Hirschfeld, J. W. P., ‘Quadrics over finite fields’,Symposia Mathematica 28 (1986), 53–87.
Hirschfeld, J. W. P. and Thas, J. A.,General Galois Geometries, Oxford University Press, Oxford 1991.
Jungnickel, D. and Tonchev, V. D., ‘Exponential number of quasi-symmetric SDP designs and codes meeting the Grey-Rankin bound’,Designs, Codes and Cryptography 1 (1991), 247–253.
Jungnickel, D. and Tonchev, V. D., ‘On symmetric and quasi-symmetric designs with the symmetric difference property and their codes’,J. Combin. Theory A 59 (1992), 40–50.
Kantor, W. M., ‘Symplectic groups, symmetric designs and line ovals’,J. Algebra 33 (1975), 43–58.
Kantor, W. M., ‘Exponential numbers of two-weight codes, difference sets and symmetric designs’,Discrete Math. 46 (1983), 95–98.
MacWilliams, F. J. and Sloane, N. J. A.,The Theory of Error-Correcting Codes, North-Holland, New York 1977.
Parker, C., Spence, E. and Tonchev, V. D., ‘The groups of the designs with the symmetric difference property on 64 points’,J. Combin. Theory A (to appear).
Shrikhande, M. S. and Sane, S. S.,Quasi-Symmetric Designs, London Math. Soc. Lecture Note Series 164, Cambridge Univ. Press, Cambridge 1991.
Tonchev, V. D.,Combinatorial Configurations, Longman, Wiley, New York, 1988.
Wolfmann, J., ‘Codes projectifs à deux poids, “caps” complets et ensembles des differences’,J. Combin. Theory A 23 (1977), 208–222.
Author information
Authors and Affiliations
Rights and permissions
About this article
Cite this article
Tonchev, V.D. Quasi-symmetric designs, codes, quadrics, and hyperplane sections. Geom Dedicata 48, 295–308 (1993). https://doi.org/10.1007/BF01264073
Received:
Revised:
Issue Date:
DOI: https://doi.org/10.1007/BF01264073