We have determined all exponents of (n, k, L)-systems of k ≤ 12 except for essentially two cases, which are related to the Steiner systems S(11, 5, 4) and S(12, 6, 5). This requires several new constructions. Also some refinements of the previous methods are necessary to get suitable upper bounds.
|Number of pages||21|
|Journal||Journal of Combinatorial Theory. Series A|
|Publication status||Published - 1996 Jul|
ASJC Scopus subject areas
- Theoretical Computer Science
- Discrete Mathematics and Combinatorics
- Computational Theory and Mathematics