Abstract
A residual design \(\mathcal{{D}}_B\) with respect to a block B of a given design \({\mathcal{{D}}}\) is defined to be linearly embeddable over GF(p) if the p-ranks of the incidence matrices of \({\mathcal{{D}}}_B\) and \({\mathcal{{D}}}\) differ by one. A sufficient condition for a residual design to be linearly embeddable is proved in terms of the minimum distance of the linear code spanned by the incidence matrix, and this condition is used to show that the residual designs of several known infinite classes of designs are linearly embeddable. A necessary condition for linear embeddability is proved for affine resolvable designs and their residual designs. As an application, it is shown that a residual design of the classical affine design of the planes in AG \((3,2^2)\) admits two nonisomorphic embeddings over GF(2) that give rise to the only known counterexamples to Hamada’s conjecture over a field of non-prime order.
This is a preview of subscription content, log in via an institution to check access.
Similar content being viewed by others
References
Assmus Jr. E.F., Key J.D.: Designs and Their Codes. Cambridge University Press, Cambridge (1992).
Beth T., Jungnickel D., Lenz H.: Design Theory, 2nd edn. Cambridge University Press, Cambridge (1999).
Blake I.F., Mullin R.C.: An Introduction to Algebraic and Combinatorial Coding Theory. Academic Press, New York (1976).
Bose R.C.: Graphs and Designs. Edizioni Cremonese, Rome (1973).
Clark D., Jungnickel D., Tonchev V.D.: Affine geometry designs, polarities, and Hamada’s conjecture. J. Comb. Theory Ser. A 118, 231–239 (2011).
Dillon J.F., Schatz J.R.: Block designs with the symmetric difference property. In: Ward R.L. (ed.) Proceedings of the NSA Mathematical Sciences Meetings, pp. 159–164. U.S. Government Printing Office, Washington, D.C. (1987).
Hall Jr. M.: Combinatorial Theory. Wiley, New York (1986).
Hamada N.: On the \(p\)-rank of the incidence matrix of a balanced or partially balanced incomplete block design and its application to error-correcting codes. Hiroshima Math. J. 3, 153–226 (1973).
Hamada N.: On the geometric structure and \(p\)-rank of affine triple system derived from a nonassociative Moufang loop with the maximum associative center. J. Comb. Theory A 30, 285–297 (1981).
Harada M., Lam C., Tonchev V.D.: Symmetric (4,4)-nets and generalized Hadamard matrices over groups of order 4. Des. Codes Cryptogr. 34, 71–87 (2005).
Helgert H.J., Stinaff R.D.: Minimum distance bounds for binary linear codes. IEEE Trans. Inf. Theory IT–19, 344–356 (1973).
Hill R., Newton D.E.: Optimal ternary codes. Des. Codes Cryptogr. 2, 137–157 (1992).
Huffman W.C., Pless V.: Fundamentals of Error-Correcting Codes. Cambridge University Press, Cambridge (2003).
Ionin Y.J., Shrikhande M.S.: Combinatorics of Symmetric Designs. Cambridge University Press, Cambridge (2006).
Jungnickel D.: The number of designs with classical parameters grows exponentially. Geom. Dedicata 16, 167–178 (1984).
Jungnickel D., Tonchev V.D.: Polarities, quasi-symmetric designs, and Hamada’s conjecture. Des. Codes Cryptogr. 51, 131–140 (2009).
Jungnickel D., Tonchev V.D.: Exponential number of quasi-symmetric SDP designs and codes meeting the Grey–Rankin bound. Des. Codes Cryptogr. 1, 247–253 (1991).
Kantor W.M.: Characterizations of finite projective and affine spaces. Can. J. Math. 21, 64–75 (1969).
Kantor W.M.: Symplectic groups, symmetric designs and line ovals. J. Algebra 33, 43–58 (1975).
Kantor W.M.: Exponential numbers of two-weight codes, difference sets and symmetric designs. Discret. Math. 46, 95–98 (1983).
Kimberley M.E.: On the construction of certain Hadamard designs. Math. Z. 119, 41–59 (1971).
Lam C., Lam S., Tonchev V.D.: Bounds on the number of affine, symmetric, and Hadamard designs and matrices. J. Comb. Theory Ser. A 92, 186–196 (2000).
Mann H.B.: A note on balanced incomplete block designs. Ann. Math. Stat. 40, 679–680 (1969).
Mavron V.C., McDonough T.P., Tonchev V.D.: On affine designs and Hadamard designs with line spreads. Discret. Math. 308, 2742–2750 (2008).
Rudolph L.D.: A class of majority-logic decodable codes. IEEE Trans. Inf. Theory 13, 305–307 (1967).
Shrikhande M.S.: Quasi-symmetric designs. In: Colbourn C.J., Dinitz J.F. (eds.) Handbook of Combinatorial Designs, 2nd edn, pp. 578–582. Chapman & Hall/CRC, Boca Raton (2007).
Shrikhande S.S.: On the non-existence of affine resolvable balanced incomplete block designs. Sankhya 11, 185–186 (1951).
Tonchev V.D.: Quasi-symmetric 2-(31,7,7) designs and a revision of Hamada’s conjecture. J. Comb. Theory A 42, 104–110 (1986).
Tonchev V.D.: Combinatorial Configurations. Wiley, New York (1988).
Tonchev V.D.: Quasi-symmetric designs, codes, quadrics, and hyperplane sections. Geom. Dedicata 48, 295–308 (1993).
Tonchev V.D.: Codes and designs, Chapter 15. In: Pless V.S., Huffman W.C. (eds.) Handbook of Coding Theory, vol. II, pp. 1229–1268. Elsevier, New York (1998).
Tonchev V.D.: Codes. In: Colbourn C.J., Dinitz J.F. (eds.) Handbook of Combinatorial Designs, 2nd edn, pp. 667–702. Chapman & Hall/CRC, Boca Raton (2007).
Acknowledgements
The author wishes to thank Dieter Jungnickel, as well as the anonymous reviewers, for carefully reading the manuscript and suggesting several corrections and improvements. This research was supported by NSA Grant H98230-16-1-0011.
Author information
Authors and Affiliations
Corresponding author
Additional information
Communicated by J. D. Key.
Rights and permissions
About this article
Cite this article
Tonchev, V.D. Linearly embeddable designs. Des. Codes Cryptogr. 85, 233–247 (2017). https://doi.org/10.1007/s10623-016-0304-6
Received:
Revised:
Accepted:
Published:
Issue Date:
DOI: https://doi.org/10.1007/s10623-016-0304-6