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.
Similar content being viewed by others
Explore related subjects
Discover the latest articles, news and stories from top researchers in related subjects.References
E. F. Assmus, Jr., On 2-ranks of Steiner triple systems, Electronic J. Combin., Vol. 2 (1995), paper R9.
E. F. Assmus, Jr., and J. D. Key, Designs and Their Codes, Cambridge University Press, Cambridge (1992).
T. Beth, D. Jungnickel, and H. Lenz, Design Theory, Cambridge University Press, Cambridge (1986).
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.
J. Doyen, Sur la structure de certains systemes triples de Steiner, Math. Zeitschrift, Vol. 111 (1969) pp. 289–300.
J. Doyen, X. Hubaut, and M. Vandensavel, Ranks of incidence matrices of Steiner triple systems, Math. Z., Vol. 163 (1978) pp. 251–259.
H. Lenz and H. Zeitler, Arcs and ovals in Steiner triple systems, Lecture Notes in Mathematics, Vol. 969 (1982) pp. 229–250.
N. V. Semakov and V. A. Zinovév, Balanced codes and tactical configurations, Problemy Peredachi Informatsii, Vol. 5(3) (1969) pp. 28–36.
L. Teirlinck, On projective and affine hyperplanes, J. Combin. Theory Ser. A, Vol. 28 (1980) pp. 290–306.
V. Tonchev, Combinatorial Configurations, Longman, Wiley, New York (1988).
V. Tonchev and R. Weishaar, Steiner triple systems of order 15 and their codes, J. Stat. Plann. Inference, to appear.
Author information
Authors and Affiliations
Rights 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
Issue Date:
DOI: https://doi.org/10.1023/A:1018068422276