There exist Steiner triple systems of order 15 that do not occur in a perfect binary one‐error‐correcting code |
| |
Authors: | Patric R J Östergård Olli Pottonen |
| |
Institution: | Department of Electrical and Communications Engineering, Helsinki University of Technology, P.O. Box 3000, 02015 TKK, Finland |
| |
Abstract: | The codewords at distance three from a particular codeword of a perfect binary one‐error‐correcting code (of length 2m?1) form a Steiner triple system. It is a longstanding open problem whether every Steiner triple system of order 2m?1 occurs in a perfect code. It turns out that this is not the case; relying on a classification of the Steiner quadruple systems of order 16 it is shown that the unique anti‐Pasch Steiner triple system of order 15 provides a counterexample. © 2006 Wiley Periodicals, Inc. J Combin Designs 15: 465–468, 2007 |
| |
Keywords: | Hamming code perfect code Steiner quadruple system Steiner triple system |
|