Construction of $(v,k,1)$ cyclic difference families with small parameters
DOI:
https://doi.org/10.13069/jacodesmath.v13i1.389Keywords:
Cyclic difference families, Multipliers, Cyclic Steiner systems, Cyclically permutable constant weight codes, Optical orthogonal codesAbstract
We construct all nonequivalent $(v,k,1)$ cyclic difference families for 18 sets of parameters $v$ and $k$ for which classification results were not known. We also present the multipliers of all previously classified CDFs with small parameters. Most of the results are double-checked by two different backtrack search algorithms. The usage of an interesting property of the considered objects makes one of these algorithms faster than the other.
Accepted: 20 September 2025
Downloads
References
J. R. Abel, M. Buratti, Some progress on (v,4,1) difference families and optical orthogonal codes, J. Combin. Theory Ser. A, 106 (2004) 59–75.
R. J. R. Abel, S. Costa, N. J. Finizio, Directed-ordered whist tournaments and (v,5,1) difference families: Existence results and some new classes of Z-cyclic solutions, Discrete Appl. Math. 143 (2004) 43–53.
R. J. R. Abel, M. Buratti, Difference families, in: Ch. Colbourn, J. Dinitz (Eds.), Handbook of Combinatorial Designs, 2nd edition, CRC Press, Boca Raton, FL. (2007).
T. Baicheva, S. Topalova, Classification results for (v,k,1) cyclic difference families with small parameters, in: M. Deza, M. Petitjean, K. Markov (Eds.), International Book Series: Information Science and Computing, book 25 (2012) 24–30.
T. Baicheva, S. Topalova, Classification of optimal (v,k,1) binary cyclically permutable constant weight codes with k = 5, 6 and 7 and small lengths, Des. Codes Cryptogr. 87 (2019) 365–374.
T. Baicheva, S. Topalova, An update on optimal (v,4,1) binary cyclically permutable constant weight codes and cyclic 2-(v,4,1) designs with small v, Probl. Inf. Transm. 60(3) (2024) 189–198.
V. N. Bhat-Nayak, V. D. Kane, W. L. Kocay, R. G. Stanton, Settling some BIBD conjectures, Ars Combin. 16 (1983) 229–234.
R. C. Bose, On the construction of balanced incomplete block designs, Ann. Eugenics 9 (1939) 353–399.
E. Brugnoli, M. Buratti, New designs by changing . . . the signs, Electron. Notes Discrete Math. 40 (2013) 49–52.
M. Buratti, F. Martinovic, A. Nakic, (27,6,5) designs with a nice automorphism group, Australasian Journal of Combinatorics 92(1) (2025) 80–95.
M. Buratti, M. Muzychuk, Some bounds on the number of cyclic Steiner 2-designs, The Art of Discrete and Applied Mathematics 8 (2025) P1.01.
M. Buratti, A. Pasotti, Further progress on difference families with block size 4 or 5, Des. Codes Cryptogr. 56 (2010) 1–20.
M. Buratti, D. Stinson, New results on modular Golomb rulers, optical orthogonal codes and related structures, Ars Mathematica Contemporanea 20 (2021) 1–27.
M. Buratti, A. Wassermann, On decomposability of cyclic triple systems, Australas. J. Comb. 71(2) (2018) 184–195.
K. Chen, L. Zhu, Existence of (q,6,1) difference families with q a prime power, Des. Codes Cryptogr. 15 (1998) 167–173.
K. Chen, R. Wei, L. Zhu, Existence of (q,7,1) difference families with q a prime power, J. Combin. Des. 10(2) (2002) 126–138.
M. J. Colbourn, R. A. Mathon, On cyclic Steiner 2-designs, Ann. Discrete Math. 7 (1980) 215–253.
C. J. Colbourn, On cyclic Steiner systems S(2,6,91), Abstracts Amer. Math. Soc. 2 (1981).
C. J. Colbourn, A. Rosa, Triple systems, Oxford University Press, Oxford (1999).
M. Fujisawa, S. Sakata, A class of quasi-cyclic regular LDPC codes from cyclic difference families with girth 8, Proceedings International Symposium on Information Theory 4–9 Sept. (2005) 2290–2294.
I. Hetman, Steiner systems S(2,6,121/126) based on difference families, arXiv:2401.08274 [math.CO] 9 Apr 2025.
M. Huber, Perfect Secrecy Systems Immune to Spoofing Attacks, International Journal of Information Security 11 (2012) 281–289.
Z. Janko, V. D. Tonchev, Cyclic 2-(91,6,1) designs with multiplier automorphisms, Discrete Math. 97(1) (1991) 265–268.
P. Kaski, P. Östergård, Classification algorithms for codes and designs, Springer, Berlin (2006).
P. Pálfy, Isomorphism Problem for Relational Structures with a Cyclic Automorphism, European J. Combin. 8 (1987) 35–43.
H. Park, S. Hong, J.-S. No, D.-J. Shin, Construction of high-rate regular quasi-cyclic LDPC codes based on cyclic difference families, IEEE Trans. Commun. 61(8) (2013) 3108–3113.
K. T. Phelps, Isomorphism Problems for Cyclic Block Designs, North-Holland Mathematics Studies 149 (1987) 385–391.
M. Zhang, T. Feng, X. Wang, The existence of cyclic (v,4,1)-designs, Des. Codes Cryptogr. 90 (2022) 1611–1628.
