On the resolutions of cyclic Steiner triple systems with small parameters
Keywords:
Resolutions, Cyclic designs, Point-cyclically resolvable, Cyclic STS(v), KTS(v)Abstract
The paper presents useful invariants of resolutions of cyclic $STS(v)$ with $v\le 39$, namely of all resolutions of cyclic $STS(15)$, $STS(21)$ and $STS(27)$, of the resolutions with nontrivial automorphisms of cyclic $STS(33)$ and of resolutions with automorphisms of order $13$ of cyclic $STS(39)$.
Downloads
References
T. Baicheva and S. Topalova, Classification results for $(v, k, 1)$ cyclic difference families with small parameters, in M. Deza, M. Petitjean, and K. Markov (Eds.), Mathematics of Distances and Applications, International Book Series Information Science and Computing 25, ITHEA, Sofia (2012) 24-30.
T. Beth, D. Jungnickel, and H. Lenz, Design Theory, Cambridge University Press, Cambridge (1993).
C. J. Colbourn and J. H. Dinitz (Eds.), Handbook of Combinatorial Designs, Second edition, Chapman & Hall/CRC, Boca Raton, FL (2007).
C. J. Colbourn, J. H. Dinitz, and D. R. Stinson, Applications of combinatorial designs to communications, cryptography, and networking, in J. D. Lamb and D. A. Preece (Eds.), Surveys in Combinatorics, 1999, London Mathematical Society Lecture Note Series 267, Cambridge University Press, Cambridge (1999) 37-100.
C. J. Colbourn, S. S. Magliveras, and R. A. Mathon, Transitive Steiner and Kirkman triple systems of order 27, Math. Comp. 58(197) (1992) 441-449.
M. J. Colbourn and R. A. Mathon, On cyclic Steiner 2-designs, Ann. Discrete Math. 7 (1980) 215-253.
M. Genma, M. Mishima, and M. Jimbo, Cyclic resolvability of cyclic Steiner 2-designs, J. Combin. Des. 5(3) (1997) 177-187.
A. Gruner and M. Huber, New combinatorial construction techniques for low-density parity-check codes and systematic repeat-accumulate codes, IEEE Trans. Commun. 60(9) (2012) 2387-2395.
M. Huber, Combinatorial designs for authentication and secrecy codes, Found. Trends Commun. Inf. Theory 5(6) (2008) 581-675.
N. L. Johnson, Two-transitive parallelisms, Des. Codes Cryptogr. 22(2) (2001) 179-189.
S. J. Johnson and S. R. Weller, Resolvable 2-designs for regular low-density parity-check codes, IEEE Trans. Commun. 51(9) (2003) 1413-1419.
S. Kageyama, A survey of resolvable solutions of balanced incomplete block designs, Int. Stat. Rev. 40(3) (1972) 269-273.
P. Kaski and P. R. J. Östergård, Classification Algorithms for Codes and Designs, Algorithms and Computation in Mathematics 15, Springer-Verlag, Berlin (2006).
C. W. H. Lam and Y. Miao, On cyclically resolvable cyclic Steiner 2-designs, J. Combin. Theory Ser. A 85(2) (1999) 194-207.
C. W. H. Lam and Y. Miao, Cyclically resolvable cyclic Steiner triple systems of order 21 and 39, Discrete Math. 219(1-3) (2000) 173-185.
R. Mathon, K. T. Phelps, and A. Rosa, A class of Steiner triple systems of order 21 and associated Kirkman systems, Math. Comp. 37(155) (1981) 209-222.
M. Mishima and M. Jimbo, Some types of cyclically resolvable cyclic Steiner 2-designs, Congr. Numer. 123 (1997) 193-203.
M. Mishima and M. Jimbo, Recursive constructions for cyclic quasiframes and cyclically resolvable cyclic Steiner 2-designs, Discrete Math. 211(1-3) (2000) 135-152.
N. V. Semakov and V. A. Zinoviev, Equidistant $q$-ary codes with maximal distance and resolvable balanced incomplete block designs, Problems Inform. Transmission 4(2) (1968) 1-7.
T. Etzion and N. Silberstein, Codes and designs related to lifted MRD codes, IEEE Trans. Inform. Theory 59(2) (2013) 1004-1017.
D. R. Stinson, Combinatorial Designs: Constructions and Analysis, Springer-Verlag, New York (2004).
V. D. Tonchev, Combinatorial Configurations, Pitman Monographs and Surveys in Pure and Applied Mathematics 40, Longman Scientific & Technical, Harlow (1988).
V. D. Tonchev, Steiner systems for two-stage disjunctive testing, J. Comb. Optim. 15(1) (2008) 1-6.
V. D. Tonchev and S. A. Vanstone, On Kirkman triple systems of order 33, Discrete Math. 106/107 (1992) 493-496.
