Premium
Generalized Steiner systems with block size three and group size g ≡ 3(mod 6)
Author(s) -
Phelps Kevin,
Yin Carol
Publication year - 1997
Publication title -
journal of combinatorial designs
Language(s) - English
Resource type - Journals
SCImago Journal Rank - 0.618
H-Index - 34
eISSN - 1520-6610
pISSN - 1063-8539
DOI - 10.1002/(sici)1520-6610(1997)5:6<417::aid-jcd3>3.0.co;2-i
Subject(s) - mathematics , combinatorics , steiner system , mod , alphabet , block size , group (periodic table) , block (permutation group theory) , constant (computer programming) , discrete mathematics , computer science , philosophy , linguistics , chemistry , organic chemistry , key (lock) , programming language , computer security
Generalized Steiner Systems, GS (2, 3, n , g ), are equivalent to maximum constant weight codes over an alphabet of size g + 1 with distance 3 and weight 3 in which each codeword has length n . We construct Generalized Steiner Triple Systems, GS (2, 3, n , g ), when g ≡ 3(mod 6). © 1997 John Wiley & Sons, Inc. J Combin Designs 5:417–432, 1997