On the Binary Codes of Steiner Triple Systems | Designs, Codes and Cryptography
Skip to main content

On the Binary Codes of Steiner Triple Systems

  • Published:
Designs, Codes and Cryptography Aims and scope Submit manuscript

Abstract

The binary code spanned by the rows of the point byblock incidence matrix of a Steiner triple system STS(v)is studied. A sufficient condition for such a code to containa unique equivalence class of STS(v)'s of maximalrank within the code is proved. The code of the classical Steinertriple system defined by the lines in PG(n-1,2)(n≥3), or AG(n,3) (n≥3) is shown to contain exactly v codewordsof weight r=(v-1)/2, hence the system is characterizedby its code. In addition, the code of the projective STS(2n-1)is characterized as the unique (up to equivalence) binary linearcode with the given parameters and weight distribution. In general,the number of STS(v)'s contained in the code dependson the geometry of the codewords of weight r. Itis demonstrated that the ovals and hyperovals of the definingSTS(v) play a crucial role in this geometry. Thisrelation is utilized for the construction of some infinite classesof Steiner triple systems without ovals.

This is a preview of subscription content, log in via an institution to check access.

Access this article

Subscribe and save

Springer+ Basic
¥17,985 /Month
  • Get 10 units per month
  • Download Article/Chapter or eBook
  • 1 Unit = 1 Article or 1 Chapter
  • Cancel anytime
Subscribe now

Buy Now

Price includes VAT (Japan)

Instant access to the full article PDF.

Similar content being viewed by others

Explore related subjects

Discover the latest articles, news and stories from top researchers in related subjects.

References

  1. E. F. Assmus, Jr., On 2-ranks of Steiner triple systems, Electronic J. Combin., Vol. 2 (1995), paper R9.

    Google Scholar 

  2. E. F. Assmus, Jr., and J. D. Key, Designs and Their Codes, Cambridge University Press, Cambridge (1992).

    Google Scholar 

  3. T. Beth, D. Jungnickel, and H. Lenz, Design Theory, Cambridge University Press, Cambridge (1986).

    Google Scholar 

  4. M.-L. de Resmini, On k-sets of type (m, n) in a Steiner system S(2, 1), in: Finite Geometries and Designs, LMS Lecture Notes, Vol. 49 (1981), pp. 104–113.

    Google Scholar 

  5. J. Doyen, Sur la structure de certains systemes triples de Steiner, Math. Zeitschrift, Vol. 111 (1969) pp. 289–300.

    Google Scholar 

  6. J. Doyen, X. Hubaut, and M. Vandensavel, Ranks of incidence matrices of Steiner triple systems, Math. Z., Vol. 163 (1978) pp. 251–259.

    Google Scholar 

  7. H. Lenz and H. Zeitler, Arcs and ovals in Steiner triple systems, Lecture Notes in Mathematics, Vol. 969 (1982) pp. 229–250.

    Google Scholar 

  8. N. V. Semakov and V. A. Zinovév, Balanced codes and tactical configurations, Problemy Peredachi Informatsii, Vol. 5(3) (1969) pp. 28–36.

    Google Scholar 

  9. L. Teirlinck, On projective and affine hyperplanes, J. Combin. Theory Ser. A, Vol. 28 (1980) pp. 290–306.

    Google Scholar 

  10. V. Tonchev, Combinatorial Configurations, Longman, Wiley, New York (1988).

    Google Scholar 

  11. V. Tonchev and R. Weishaar, Steiner triple systems of order 15 and their codes, J. Stat. Plann. Inference, to appear.

Download references

Author information

Authors and Affiliations

Authors

Rights and permissions

Reprints and permissions

About this article

Cite this article

Baartmans, A., Landjev, I. & Tonchev, V.D. On the Binary Codes of Steiner Triple Systems. Designs, Codes and Cryptography 8, 29–43 (1996). https://doi.org/10.1023/A:1018068422276

Download citation

  • Issue Date:

  • DOI: https://doi.org/10.1023/A:1018068422276