In a study of multilength variable-weight optical orthogonal codes (MLVWOOCs), compatible (N, M, W, 1, Q; 2) difference packing (briefly (N, M, W, 1, Q; 2)-CDP) set systems play an important role. In this paper, a new consequence of Weil’s theorem on multiplicative character sums is presented, some direct constructions of pairwise 2-compatible balanced (n, g, W, 1) difference families (DFs) are obtained for \(W=\{3,4\}\), \(\{3,5\}\), and recursive constructions for (N, M, W, 1, Q; 2)-CDP set systems are derived by means of semicyclic group divisible designs (SCGDDs). Some series of compatible difference packing set systems are produced, and several infinite classes of optimal MLVWOOCs are then obtained.

在研究多长度可变权重光正交码 (MLVWOOCs) 时，兼容 ( N ,  M ,  W , 1,  Q ; 2) 差分打包（简称 ( N ,  M ,  W , 1,  Q ; 2)-CDP）集系统发挥着重要作用。在本文中，韦尔对乘法特征总和定理的一个新的结果被呈现，一些直接构造成对2兼容平衡（Ñ， 克，  w ^，1），得到差族（DFS）为\（W = \ {3 ,4\}\)、\(\{3,5\}\)和 ( N , M ,  W , 1,  Q ; 2)-CDP 集合系统是通过半循环群可分设计 (SCGDDs) 推导出来的。产生了一些兼容的差分包装集系统，然后得到了几个无限类的最优MLVWOOCs。