Abstract

AbstractIn this article, we investigate a block sequence of a Steiner quadruple system which contains the blocks exactly once such that the collection of all blocks together with all unions of two consecutive blocks of the sequence forms an error correcting code with minimum distance four. In particular, we give two recursive constructions and obtain infinitely many such sequences by utilizing individual sequences as starters of the recursions. © 2007 Wiley Periodicals, Inc. J Combin Designs 16: 152–163, 2008

Full Text
Paper version not known

Talk to us

Join us for a 30 min session where you can share your feedback and ask us any queries you have

Schedule a call