Optimal (4up, 5, 1) optical orthogonal codes

被引：77

作者：

Chang, YX ^{[1
]}

Ji, L

机构：

[1] Beijing Jiaotong Univ, Dept Math, Beijing 100044, Peoples R China

[2] Suzhou Univ, Dept Math, Suzhou 215006, Peoples R China

来源：

JOURNAL OF COMBINATORIAL DESIGNS | 2004年 / 12卷 / 05期

关键词：

optical orthogonal code; character slim estimate; relative d difference family; cyclic packing;

D O I：

10.1002/jcd.20011

中图分类号：

O1 [数学];

学科分类号：

0701 ; 070101 ;

摘要：

By a (v,k,1)-OOC we mean an optical orthogonal code. In this paper, it is proved that an optimal (4p, 5, 1) -OOC exists for prime p equivalent to 1 (mod 10), and that an optimal (4up, 5, 1)-OOC exists for u = 27 3 and prime p equivalent to 11 (mod 20). These results are obtained by applying Weil's theorem. (C) 2004 Wiley Periodicals, Inc.

引用

页码：346 / 361

页数：16

共 27 条

[1]

Abel R.J.R., 1997, AUSTRALAS J COMBIN, V15, P177

[2]

[Anonymous], 1999, LOND MATH SOC LECT N

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

[4]

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

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

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

[7]

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

[8]

2-D

[9]

BURATTI M, COMMUNICATION

[10]

BURATTI M, 1998, AUSTRALAS J COMBIN, V17, P199

← 1 2 3 →