Abstract
It was proved recently by Jungnickel and Tonchev (2017) that for every integer \(v=3^{m-1}w\), \(m\ge 2\), and \(w\equiv 1,3 \pmod 6\), there is a ternary linear \([v,v-m]\) code C, such that every Steiner triple system \({{\mathrm{STS}}}(v)\) on v points and having 3-rank \(v-m\), is isomorphic to an \({{\mathrm{STS}}}(v)\) supported by codewords of weight 3 in C. In this paper, we consider the ternary \([3^n, 3^n -n]\) code \(C_n\) (\(n\ge 3\)), that supports representatives of all isomorphism classes of \({{\mathrm{STS}}}(3^n)\) of 3-rank \(3^n -n\). We prove some structural properties of the triple system supported by the codewords of \(C_n\) of weight 3. Using these properties, we compute the exact number of distinct \({{\mathrm{STS}}}(27)\) of 3-rank 24 supported by the code \(C_3\). As an application, we prove a lower bound on the number of nonisomorphic \({{\mathrm{STS}}}(27)\) of 3-rank 24, and classify up to isomorphism all \({{\mathrm{STS}}}(27)\) supported by \(C_3\) that admit a certain automorphism group of order 3.
Access this chapter
Tax calculation will be finalised at checkout
Purchases are for personal use only
References
Assmus Jr., E.F.: On \(2\)-ranks of Steiner triple systems. Electron. J. Comb. 2 (1995). #R9
Assmus Jr., E.F., Key, J.D.: Designs and Their Codes. Cambridge University Press, New York (1992)
Beth, T., Jungnickel, D., Lenz, H.: Design Theory, 2nd edn. Cambridge University Press, Cambridge (1999)
Betten, A., Braun, M., Fripertinger, H., Kerber, A., Kohnert, A., Wassermann, A.: Error-Correcting Linear Codes, Classification by Isometry and Applications. Springer, Heidelberg (2006)
Bosma, W., Cannon, J.: Handbook of Magma Functions. Department of Mathematics, University of Sydney, Sydney (1994)
Colbourn, C.J., Dinitz, J.F. (eds.): Handbook of Combinatorial Designs, 2nd edn. Chapman & Hall/CRC, Boca Raton (2007)
Colbourn, C.J., Magliveras, S.S., Mathon, R.A.: Transitive Steiner and Kirkman triple systems of order 27. Math. Comp. 58(197), 441–450 (1992)
Doyen, J., Hubaut, X., Vandensavel, M.: Ranks of incidence matrices of Steiner triple systems. Math. Z. 163, 251–259 (1978)
Jungnickel, D., Tonchev, V.D.: On Bonisoli’s theorem and the block codes of Steiner triple systems. Des. Codes Crypt. (2017). https://doi.org/10.1007/s10623-017-0406-9
Jungnickel, D., Tonchev, V.D.: Counting Steiner triple systems with classical parameters and prescribed rank, ArXiv e-prints, 1709.06044 (2017)
Kaski, P., Östergård, P.R.J.: The Steiner triple systems of order 19. Math. Comp. 73, 2075–2092 (2004)
Knuth, D.E.: Dancing links. In: Roscoe, A.W., Davies, J., Woodcock, J. (eds.) Millennial Perspectives in Computer Science, Cornerstones of Computing, pp. 187–214. Palgrave, Hertfordshire (2000)
Mathon, R., Rosa, A.: 2-\((v, k,\lambda )\) designs of small order. In: Colbourn, C.J., Dinitz, J.F. (eds.) Handbook of Combinatorial Designs, 2nd edn. Chapman & Hall/CRC, Boca Raton (2007)
Niskanen, S., Östergård, P.R.J.: Cliquer User’s Guide, Version 1.0. Technical Report T48, Communications Laboratory, Helsinki University of Technology, Espoo, Finland (2003)
Osuna, O.P.: There are 1239 Steiner triple systems STS\((31)\) of 2-rank 27. Des. Codes Crypt. 40, 187–190 (2006)
Soicher, L.H.: DESIGN Package (Version 1.6) for GAP. http://www.maths.qmul.ac.uk/~leonard/designtheory.org/software/
Teirlinck, L.: Combinatorial structures, Ph.D. thesis, University of Brussels, Brussels (1976)
Teirlinck, L.: On projective and affine hyperplanes. J. Comb. Theor. Ser. A 28, 290–306 (1980)
Tonchev, V.D.: Linear perfect codes and a characterization of the classical designs. Des. Codes Crypt. 17, 121–128 (1999)
Tonchev, V.D.: A mass formula for Steiner triple systems STS\((2^{n}-1)\) of 2-rank \(2^n -n\). J. Comb. Theor. Ser. A 95, 197–208 (2001)
Tonchev, V.D.: A formula for the number of Steiner quadruple systems on \(2^n\) points of 2-rank \(2^n-n\). J. Comb. Des. 11, 260–274 (2003)
Tonchev, V.D.: Codes and designs. In: Pless, V.S., Huffman, W.C. (eds.) Handbook of Coding Theory, Chap. 15, vol. II, pp. 1229–1267. Elsevier, Amsterdam (1998)
Acknowledgements
The authors wish to thank the unknown referees for reading carefully the manuscript and making several useful remarks. Vladimir Tonchev acknowledges support by the Alexander von Humboldt Foundation and NSA Grant H98230-16-1-0011.
Author information
Authors and Affiliations
Corresponding author
Editor information
Editors and Affiliations
Rights and permissions
Copyright information
© 2017 Springer International Publishing AG
About this paper
Cite this paper
Jungnickel, D., Magliveras, S.S., Tonchev, V.D., Wassermann, A. (2017). On Classifying Steiner Triple Systems by Their 3-Rank. In: Blömer, J., Kotsireas, I., Kutsia, T., Simos, D. (eds) Mathematical Aspects of Computer and Information Sciences. MACIS 2017. Lecture Notes in Computer Science(), vol 10693. Springer, Cham. https://doi.org/10.1007/978-3-319-72453-9_24
Download citation
DOI: https://doi.org/10.1007/978-3-319-72453-9_24
Published:
Publisher Name: Springer, Cham
Print ISBN: 978-3-319-72452-2
Online ISBN: 978-3-319-72453-9
eBook Packages: Computer ScienceComputer Science (R0)