Some recent developments on BIBDs and related designs
Discrete Mathematics - Special issue on discrete mathematics in China
Some combinational constructions for optical orthogonal codes
Discrete Mathematics
Combinatorial theory (2nd ed.)
Combinatorial theory (2nd ed.)
Optical orthogonal codes: their bounds and new optimal constructions
IEEE Transactions on Information Theory
Constructions of difference covering arrays
Journal of Combinatorial Theory Series A
Cyclic Difference Packing and Covering Arrays
Designs, Codes and Cryptography
On constructions for optimal two-dimensional optical orthogonal codes
Designs, Codes and Cryptography
Two-dimensional optical orthogonal codes and semicyclic group divisible designs
IEEE Transactions on Information Theory
Semicyclic 4-GDDs and related two-dimensional optical orthogonal codes
Designs, Codes and Cryptography
Some 20-regular CDP(5,1;20u) and their applications
Finite Fields and Their Applications
| Hi-index | 0.06 |
Cyclic packing designs of pairs have various applications in communications. In this paper, the concept of a (g1, g2, ..., gr; u)-regular cyclic packing design is defined, and used to establish a quite general recursive construction concerning cyclic packing designs. As corollaries, we are able to unify many known constructions for cyclic designs. As an application, we obtain infinite series of new optimal cyclic packing designs which can be utilized directly to produce new optimal optical orthogonal codes.