Cyclic designs with block size 4 and related optimal optical orthogonal codes

Designs, Codes, and Cryptography

Volumn 26, Issue 1-3, 2002, Pages 111-125

  Buratti, Marco ^a  

^a UNIVERSITY OF PERUGIA   (Italy)

Author keywords

Cyclic block design; Cyclic group divisible design; Optimal optical orthogonal code; Relative difference family

Indexed keywords

CODES (SYMBOLS);

BLOCK SIZES; CYCLIC BLOCK DESIGNS; CYCLIC DESIGN; CYCLIC GROUP; EXPLICIT CONSTRUCTIONS; OPTICAL ORTHOGONAL CODES; PRIME FACTORS; RELATIVE DIFFERENCE FAMILIES;

OPTIMAL SYSTEMS;

EID: 31244433757     PISSN: 09251022     EISSN: 15737586     Source Type: Journal    
DOI: 10.1023/a:1016505309092     Document Type: Article

References (39)

1. R. J. R. Abel, Difference families, In (C. J. Colbourn and J. H. Dinitz, eds.), CRC Handbook of Combinatorial Designs, CRC Press, Boca Raton, FL (1996) pp. 270-287.
2. I. Anderson, Some cyclic and 1-rotational designs, In (J. W. P. Hirschfeld, ed.), Surveys in Combinatorics, 2001, Cambridge University Press (2001) pp. 47-73.
3. T. Beth, D. Jungnickel and H. Lenz, Design Theory, Cambridge University Press (1999).
4. I. C. M. Bird and A. D. Keedwell, Design and applications of optical orthogonal codes—a survey, ICA, Vol. 11 pp. 21–44.
5. S. Bitan and T. Etzion, Constructions for optimal constant weight cyclically permutable codes and difference families, IEEE Trans. Inform. Theory, Vol. 41 (1995) pp. 77-87.
6. R. C. Bose, On the construction of balanced incomplete block designs, Ann. Eugenics, Vol. 9 (1939) pp. 353-399.
7. A. E. Brouwer, A. Schrijver and H. Hanani, Group divisible design with block-size four, Discrete Math., Vol. 20 (1977) pp. 1-19.
8. M. Buratti, Improving two theorems of Bose on difference families, J. of Combin. Designs, Vol. 3 (1995) pp. 15-24.
9. M. Buratti, Constructions of (q, k, 1) difference families with q a prime power and k = 4,5, Discrete Math., Vol. 138 (1995) pp. 169-175.
10. M. Buratti, A packing problem and its application to Bose’s families, J. of Combin. Designs, Vol. 4 (1996) pp. 457–472.
11. M. Buratti, From a (G,k, 1) to a (Ck ⊕ G, k, 1) difference family, Designs, Codes and Cryptography, Vol. 11 (1997) pp. 5-9.
12. M. Buratti, Recursive constructions for difference matrices and relative difference families, J. of Combin. Designs, Vol. 6 (1998) pp. 165-182.
13. M. Buratti, Old and new designs via difference multisets and strong difference families, J. of Combin. Designs, Vol. 7 (1999) pp. 406-425.
14. M. Buratti, Existence of Z-cyclic triplewhist tournaments for a prime number of players, J. Combin. Theory A, Vol. 90 (2000) pp. 315-325.
15. M. Buratti, Some regular Steiner 2-designs with block-size 4, Ars Combinatoria, Vol. 55 (2000) pp. 133-137.
16. K. Chen and L. Zhu, Existence of (q,k, 1) difference families with q a prime power and k = 4, 5, J. Combin. Designs, Vol. 7 (1999) pp. 21-30.
17. K. Chen and L. Zhu, Existence of (q, 6, 1) difference families with q a prime power, Designs, Codes and Cryptography, Vol. 15 (1998) pp. 167-173.
18. K. Chen and L. Zhu, Existence of AP AV (q, k) with q a prime power = 3 (mod 4) and k odd > 1, J. Combin. Designs, Vol. 7 (1999) pp. 57-68.
19. K. Chen and L. Zhu, Improving Wilson’s bound on difference families, Utilitas Math., Vol. 55 (1999) pp. 189–200.
20. K. Chen, G. Ge and L. Zhu, Starters and related codes, J. Statist. Plann. Inference, Vol. 86 (2000) pp. 595–604.
21. P. L. Check and C. J. Colbourn, Concerning difference families with block size four, Discrete Math., Vol. 133 (1994) pp. 285–289.
22. F. R. K. Chung, J. A. Salehi and V. K. Wei, Optical orthogonal codes: design, analysis and applications, IEEE Trans. Inform. Theory, Vol. 35 (1989) pp. 595–604.
23. M. J. Colbourn and C. J. Colbourn, Cyclic block designs with block size 3, Eur. J. Combin., Vol. 2 (1981) pp. 21–26.
24. M. J. Colbourn and C. J. Colbourn, Recursive constructions for cyclic block designs, J. Statist. Plann. Inference, Vol. 10 (1984) pp. 97–103.
25. M. J. Colbourn and R. A. Mathon, On cyclic Steiner 2-designs, Ann. Discrete Math., Vol. 7 (1980) pp. 215–253.
26. C. J. Colbourn, J. H. Dinitz and D. R. Stinson, Applications of combinatorial designs to communications, cryptography and networking, London Math. Soc. Lecture Note Ser., Vol. 267 (1999) pp. 37–100.
27. R. Fuji-Hara, Y. Miao and J. Yin, Optimal (9v, 4,1) optical orthogonal codes with v a product of primes congruent to 1 modulo 4, SIAM J. Discrete Math., Vol. 14 (2001) pp. 256–266.
28. K. B. Gross, On the maximal number of pairwise orthogonal Steiner triple systems, J. Combin. Theory Ser. A, Vol. 19 (1975) pp. 256–263.
29. M. Jimbo, A recursive construction for 1-rotational Steiner 2-designs, Utilitas Math., Vol. 26 (1984) pp. 45–61.
30. C. Lam and Y. Miao, On cyclically resolvable cyclic Steiner 2-designs, J. Combin. Theory A, Vol. 85 (1999) pp. 194–207.
31. R. Liedl and H. Niederreiter, Finite Fields, Encyclopedia of Mathematics and its Applications, Vol. 20, Cambridge University Press (1997).
32. R. Mathon, Constructions for cyclic Steiner 2-designs, Ann. Discrete Math., Vol. 34 (1987) pp. 353–362.
33. E. H. Moore, Tactical Memoranda I-III, Amer. J. Math., Vol. 18 (1896) pp. 204–303.
34. R. Peltesohn, Eine Losung der beiden Heffterschen Differenzenprobleme, Compos. Math., Vol. 6 (1938) pp. 251–257.
35. A. Pott, A survey on relative difference sets, Groups, Difference Sets, and the Monster, de Gruyter Berline-New York (1996) pp. 195–232.
36. R. Rees and N. Shalaby, Simple and indecomposable twofold cyclic triple systems from Skolem sequences, J. Combin. Designs, Vol. 8 (2000) pp. 402–410.
37. R. M. Wilson, Cyclotomy and difference families in elementary abelian groups, J. Number Theory, Vol. 4 (1972) pp. 17–47.
38. J. Yin, Some combinatorial constructions for optical orthogonal codes, Discrete Math., Vol. 185 (1998) pp. 201–219.
39. G. Ge and J. Yin, Constructions for optimal(v, 4, 1)optical orthogonal codes via skew starters and cyclotomic numbers, preprint.