Design theory
Combinatorial configurations, designs, codes, graphs
Combinatorial configurations, designs, codes, graphs
Designs and their codes
Linearly Derived Steiner Triple Systems
Designs, Codes and Cryptography
Computing Linear Codes and Unitals
Designs, Codes and Cryptography
Point Code Minimum Steiner Triple Systems
Designs, Codes and Cryptography
| Hi-index | 0.00 |
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\geq 3), or AG(n,3) ( n\geq3) 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(2^{n}-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.