๐”– Bobbio Scriptorium
โœฆ   LIBER   โœฆ

Optimal and pessimal orderings of Steiner triple systems in disk arrays

โœ Scribed by Myra B. Cohen; Charles J. Colbourn

Publisher
Elsevier Science
Year
2003
Tongue
English
Weight
158 KB
Volume
297
Category
Article
ISSN
0304-3975

No coin nor oath required. For personal study only.

๐Ÿ“œ SIMILAR VOLUMES

Steiner triple systems of order 15 and t
Steiner triple systems of order 15 and their codes
โœ Vladimir D. Tonchev; Robert S. Weishaar ๐Ÿ“‚ Article ๐Ÿ“… 1997 ๐Ÿ› Elsevier Science ๐ŸŒ English โš– 392 KB

The binary linear codes generated by incidence matrices of the 80 Steiner triple systems on 15 points (STS( )) are studied. The 80 codes of length 35 spanned by incidence vectors of the points are all non-isomorphic. In contrast, a pair of codes of length 15 generated by blocks are isomorphic if and

On cliques in spanning graphs of project
On cliques in spanning graphs of projective Steiner triple systems
โœ Frantisek Franek ๐Ÿ“‚ Article ๐Ÿ“… 2000 ๐Ÿ› John Wiley and Sons ๐ŸŒ English โš– 129 KB ๐Ÿ‘ 3 views

We are interested in the sizes of cliques that are to be found in any arbitrary spanning graph of a Steiner triple system S S. In this paper we investigate spanning graphs of projective Steiner triple systems, proving, not surprisingly, that for any positive integer k and any sufยฎciently large proje

There exist Steiner triple systems of or
There exist Steiner triple systems of order 15 that do not occur in a perfect binary one-error-correcting code
โœ Patric R. J. ร–stergรฅrd; Olli Pottonen ๐Ÿ“‚ Article ๐Ÿ“… 2007 ๐Ÿ› John Wiley and Sons ๐ŸŒ English โš– 74 KB ๐Ÿ‘ 1 views

## Abstract The codewords at distance three from a particular codeword of a perfect binary oneโ€errorโ€correcting code (of length 2^m^โˆ’1) form a Steiner triple system. It is a longstanding open problem whether every Steiner triple system of order 2^m^โˆ’1 occurs in a perfect code. It turns out that thi