Optimal (n,4,2)-OOC of small orders

Discrete Mathematics

Volumn 279, Issue 1-3, 2004, Pages 163-172

  Chu, Wensong ^a   Colbourn, Charles J ^a  

^a Arizona State University   (United States)

Author keywords

Cyclic Steiner quadruple systems; Maximal clique problem; Optical orthogonal codes; r simple matrices

Indexed keywords

ALGEBRA; CODES (SYMBOLS); SET THEORY; THEOREM PROVING;

CYCLIC STEINER QUADRUPLE SYSTEMS; MAXIMAL CLIQUE PROBLEM; OPTICAL ORTHOGONAL CODES; R-SIMPLE MATRICES;

ALGORITHMS;

EID: 1342265864     PISSN: 0012365X     EISSN: None     Source Type: Journal    
DOI: 10.1016/S0012-365X(03)00266-8     Document Type: Article

References (12)

1. Battiti R., Protasi M. Reactive local search for the maximum clique problem. Algorithmica. 29(4):2001;610-637.
2. Wensong Chu, Optical orthogonal codes and cyclic t -designs, Ph.D. Thesis, University of Southern California, 2002.
3. Wensong Chu, S.W. Golomb, A new recursive construction for optical orthogonal codes, IEEE Trans. Inform. Theory, November 2003, to be published.
4. Wensong Chu, S.W. Golomb, From optical orthogonal codes to cyclic Steiner quadruple systems, 2001, preprint.
5. Chung F.R.K., Salehi J.A., Wei V.K. Optical orthogonal codes. design, analysis and applications IEEE Trans. Inform. Theory. 35(3):1989;595-604.
6. C. Colbourn, Web page, http://www.public.asu.edu/̃ccolbou/.
7. Hanani H. On quadruple systems. Canad. J. Math. 12:1960;145-157.
8. Ji L., Zhu L. An improved product construction of rotational Steiner quadruple systems. J. Combin. Des. 10(6):2002;433-443.
9. Östergård P.R.J. A new algorithm for the maximum-weight clique problem. Nordic J. Comput. 8:2001;424-436.
10. Östergård P.R.J. A fast algorithm for the maximum clique problem. Discrete Appl. Math. 120:2002;197-207.
11. Phelps K.T. Rotational Steiner quadruple systems. Ars Combin. 4:1977;177-185.
12. Lie Zhu, Private e-mail communication, 2001.