Recursive constructions for optimal \((n,4,2)\)-OOCs. (English) Zbl 1073.94027
Using set-theoretic definition of optical orthogonal code (OOC) and close relation between OOCs and (partial) cyclic \(t\)-designs the authors address the problem of recursive constructions for (a family of) optimal OOCs. They first make use of the known basic construction to provide the majority of codewords needed in the optimal OOC. Then, the search for the remaining part is reduced to a finite maximal clique problem (MCP). By finding an optimal solution for the MCP an optimal OOCs is then constructed.
Reviewer: Jozef Vyskoč (Bratislava)
References:
| [1] | Cho, Ars Combinaoria 10 pp 123– (1980) |
| [2] | Chu, Discrete Math |
| [3] | Chu, IEEE Trans Inform Theory 49 pp 3072– (2003) |
| [4] | and From optical orthogonal codes to cyclic t-designs, 2001 (preprint). |
| [5] | Optical orthogonal codes and cyclic t-designs, University of Southern California, Ph.D. Thesis, 2002. |
| [6] | Chung, IEEE Trans Inform Theory 36 pp 866– (1990) |
| [7] | R. K. Chung, IEEE Trans Inform Theory 35 pp 595– (1989) |
| [8] | Colbourn, Ars Combin 11 pp 95– (1980) |
| [9] | and Steiner quadruple systems?A survey, contemporary design theory, and (Editors), Wiley, New York, 1992, pp. 205-240. |
This reference list is based on information provided by the publisher or from digital mathematics libraries. Its items are heuristically matched to zbMATH identifiers and may contain data conversion errors. In some cases that data have been complemented/enhanced by data from zbMATH Open. This attempts to reflect the references listed in the original paper as accurately as possible without claiming completeness or a perfect matching.
