Relative Difference Families With Variable Block Sizes and Their Related OOCs

被引：42

作者：

Buratti, Marco ^{[1
]}

Wei, Yueer ^{[2
]}

Wu, Dianhua ^{[2
,3
]}

Fan, Pingzhi ^{[3
]}

Cheng, Minquan ^{[4
]}

机构：

[1] Univ Perugia, Dipartimento Matemat & Informat, I-06123 Perugia, Italy

[2] Guangxi Normal Univ, Dept Math, Guilin 541004, Peoples R China

[3] SW Jiaotong Univ, Keylab Informat Coding & Transmiss, Chengdu 610031, Peoples R China

[4] Univ Tsukuba, Inst Policy & Planning Sci, Tsukuba, Ibaraki 3058573, Japan

来源：

IEEE TRANSACTIONS ON INFORMATION THEORY | 2011年 / 57卷 / 11期

关键词：

Graph decomposition; relative difference family; variable-weight optical orthogonal code; OPTICAL ORTHOGONAL CODES; MULTIPLE-ACCESS TECHNIQUES; COMBINATORIAL CONSTRUCTIONS; RECURSIVE CONSTRUCTIONS; FIBER NETWORKS; BOUNDS; EXISTENCE; DESIGNS;

D O I：

10.1109/TIT.2011.2162225

中图分类号：

TP [自动化技术、计算机技术];

学科分类号：

0812 ;

摘要：

Seven infinite classes of relative difference families with variable block sizes are presented explicitly. In particular, a balanced (gv, g, K, 1)-DF with g = Sigma(k is an element of K) k2 - k/2 is explicitly given for: (i) K = {3, 4, 5} and every v coprime to 6; (ii) K = {3, 4, 6}, {3, 5, 6} or {3, 4, 5, 6} and every v coprime to 30. As far as the authors are aware, these difference families can be viewed as the first explicit constructions of infinite classes of optimal variable-weight optical orthogonal codes with more than two weights. It is observed, however, that there are infinitely many values of v for which an optimal (v, W, 1, Q)-OOC exists, whatever the set of weights and the weight distribution sequence are.

引用

页码：7489 / 7497

页数：9

共 59 条

[1] 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

[2]

Abel RJR., 2006, Handbook of Combinatorial Designs, V2, P392

[3]

Arasu KT, 2005, AUSTRALAS J COMB, V32, P213

[4] CONSTRUCTIONS FOR OPTIMAL CONSTANT WEIGHT CYCLICALLY PERMUTABLE CODES AND DIFFERENCE-FAMILIES [J].

BITAN, S ;

ETZION, T .

IEEE TRANSACTIONS ON INFORMATION THEORY, 1995, 41 (01) :77-87

[5]

Brickell E. F., 1987, C NUMER, V58, P175

[6]

Bryant D., 2006, HDB COMBINATORIAL DE, V2nd, P477

[7] Cyclic designs with block size 4 and related optimal optical orthogonal codes [J].

Buratti, M .

DESIGNS CODES AND CRYPTOGRAPHY, 2002, 26 (1-3) :111-125

[8]

Buratti M, 1998, J COMB DES, V6, P165, DOI 10.1002/(SICI)1520-6610(1998)6:3<165::AID-JCD1>3.0.CO

[9]

2-D

[10] Pairwise balanced designs from finite fields [J].

Buratti, M .

DISCRETE MATHEMATICS, 1999, 208 :103-117

← 1 2 3 4 5 6 →