×

A general construction for optimal cyclic packing designs. (English) Zbl 0991.05028

A packing design (or just packing) is a collection of \(k\)-element subsets (called blocks) out of a \(v\)-set \(V\) such that each pair of elements of \(V\) is contained in at most \(\lambda\) blocks. Optimal packings have the smallest possible number of blocks for given values of \(v\), \(k\), and \(\lambda\). The author presents recursive constructions of optimal cyclic packings, both unifying old results and producing new infinite series of these packings.

MSC:

05B40 Combinatorial aspects of packing and covering
Full Text: DOI

References:

[1] Bird, I. C.M.; Keedwell, A. D., Design and applications of optical orthogonal codes—A survey, Bull. Inst. Combin. Appl., 11, 21-44 (1994) · Zbl 0809.05014
[2] Brickell, E. F.; Wei, V. K., Optical orthogonal codes and cyclic block designs, Congr. Numer., 58, 175-192 (1987) · Zbl 0668.94012
[3] Chen, K.; Ge, G.; Zhu, L., Starters and related codes, J. Statist. Plann. Inference, 86, 379-395 (2000) · Zbl 0957.05018
[4] Chung, F. P.K.; Salehi, J. A.; Wei, V. K., Optical orthogonal codes: Design, analysis, and applications, IEEE Trans. Inform. Theory, 35, 595-604 (1989) · Zbl 0676.94021
[5] Colbourn, M. J.; Colbourn, C. J., On cyclic block designs, Math. Rep. Canad. Acad. Sci., 2, 95-98 (1980) · Zbl 0427.05015
[6] Colbourn, C. J.; Dinitz, J. H., The CRC Handbook of Combinatorial Designs (1996), CRC Press: CRC Press Boca Raton · Zbl 0836.00010
[7] Colbourn, C. J.; Dinitz, J. H.; Stinson, D. R., Applications of combinatorial designs to communications, cryptography and networking, London Math. Soc. Lecture Note Ser. (1999), Cambridge Univ. Press: Cambridge Univ. Press Cambridge, p. 37-100 · Zbl 0972.94052
[8] Fuji-Hara, R.; Miao, Y., Optimal orthogonal codes: Their bounds and new optimal constructions, IEEE Trans. Inform. Theory, 46, 2396-2406 (2000) · Zbl 1009.94014
[9] Hall, M., Combinatorial Theory (1986), Wiley: Wiley New York · Zbl 0588.05001
[10] Hanani, H., Balanced incomplete block designs and related designs, Discrete Math., 11, 255-369 (1975) · Zbl 0361.62067
[11] Jimbo, M.; Kuriki, S., On a composition of cyclic 2-designs, Discrete Math., 46, 249-255 (1983) · Zbl 0526.05011
[12] Maric, S. V.; Lau, V. K.N., Multirate fiber-optic CDMA: System design and performance analysis, J. Lightwave Technol., 16, 9-17 (1998)
[13] Maric, S. V.; Moreno, O.; Corrada, C., Multimedia transmission in fiber-optic LANs using optical CDMA, J. Lightwave Technol., 14, 2149-2153 (1996)
[14] Mills, W. H.; Mullin, R. C., Coverings and packings, (Dinitz, J. H.; Stinson, D. R., Contemporary Design Theory: A Collection of Surveys (1992), Wiley: Wiley New York), 371-399 · Zbl 0783.05038
[15] Salehi, J. A., Code-division multiple access techniques in optical fiber networks, Part 1. Fundamental principles, IEEE Trans. Commun., 37, 824-833 (1989)
[16] Salehi, J. A.; Brackett, C. A., Code-division multiple access techniques in optical fiber networks. Part 2. Systems performance, IEEE Trans. Commun., 37, 834-842 (1989)
[17] Yang, Yixian; Lin, Xuduan, Code and Cryptography (1992), Renmin Youdian Press: Renmin Youdian Press Beijing
[18] Yin, J., Some combinatorial constructions for optical orthogonal codes, Discrete Math., 185, 201-219 (1998) · Zbl 0949.94010
[19] Zhu, L., Some recent developments on BIBDs and related designs, Discrete Math., 123, 189-214 (1993) · Zbl 0795.05026
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.