Combinatorial constructions for optimal multiple-weight optical orthogonal signature pattern codes

被引:7
作者
Zhao, Hengming [1 ]
Qin, Rongcun [1 ]
机构
[1] Guangxi Univ, Xingjian Coll Sci & Liberal Arts, Nanning 530004, Peoples R China
关键词
Optical orthogonal signature pattern code; Difference packing; Relative difference family; Incomplete difference matrix; 1; DIFFERENCE-FAMILIES; PAIRWISE BALANCED DESIGNS; CDMA NETWORKS; PRIME POWER; IMAGE TRANSMISSION; ACCESS NETWORKS; EXISTENCE; MATRICES; SIZES;
D O I
10.1016/j.disc.2015.08.005
中图分类号
O1 [数学];
学科分类号
0701 ; 070101 ;
摘要
Multiple-weight (MW) optical orthogonal signature pattern code (OOSPC) was introduced by Kwong and Yang for 2-D image transmission in multicore-fiber optical code-division multiple-access (OCDMA) networks with multiple quality of services (QoS) requirement. In this paper, an upper bound on the maximum code size of (u x v, W, 1, Q)-OOSPC is improved. By using quadratic residues and skew starters, some direct constructions for balanced (3 x gv, 3 x g, {3, 4}, 1)-OOSPCs are given for some positive integers g and v. Several recursive constructions for balanced (u x v, W, 1)-OOSPCs are presented by means of incomplete difference matrices and perfect relative difference families. By using those constructions, a balanced optimal (3u x 9v, {3, 4}, 1)-OOSPC is obtained for any pair of positive integers (u, v) with gcd(u, 3) = 1. (C) 2015 Elsevier B.V. All rights reserved.
引用
收藏
页码:179 / 193
页数:15
相关论文
共 43 条
[1]  
Abel R.J.R., 2007, CRC HDB COMBINATORIA, P160
[2]   Crucial words and the complexity of some extremal problems for sets of prohibited words [J].
Evdokimov, A ;
Kitaev, S .
JOURNAL OF COMBINATORIAL THEORY SERIES A, 2004, 105 (02) :273-289
[3]  
Buratti M., 1995, Designs, Codes and Cryptography, V5, P13, DOI 10.1007/BF01388501
[4]   CONSTRUCTIONS OF (Q, K, 1) DIFFERENCE-FAMILIES WITH Q A PRIME POWER AND K=4, 5 [J].
BURATTI, M .
DISCRETE MATHEMATICS, 1995, 138 (1-3) :169-175
[5]  
Buratti M, 1998, J COMB DES, V6, P165, DOI 10.1002/(SICI)1520-6610(1998)6:3<165::AID-JCD1>3.0.CO
[6]  
2-D
[7]   Pairwise balanced designs from finite fields [J].
Buratti, M .
DISCRETE MATHEMATICS, 1999, 208 :103-117
[8]  
Buratti M, 1999, J COMB DES, V7, P406, DOI 10.1002/(SICI)1520-6610(1999)7:6<406::AID-JCD2>3.3.CO
[9]  
2-L
[10]   Strong Difference Families Over Arbitrary Graphs [J].
Buratti, Marco ;
Gionfriddo, Lucia .
JOURNAL OF COMBINATORIAL DESIGNS, 2008, 16 (06) :443-461