Construction for optimal optical orthogonal codes

Authors:
Yanxun Chang;Ying Miao
Affiliations:
Department of Mathematics, Northern Jiaotong University, Beijing 100044, People's Republic of China;Institute of Policy and Planning Sciences, University of Tsukuba, 1-1-1 Tennodai, Tsukuba, Ibaraki 305-8573, Japan
Venue:
Discrete Mathematics - Papers on the occasion of the 65th birthday of Alex Rosa
Year:
2003

Citing 5
Cited 16

Design theory

Design theory
Some combinational constructions for optical orthogonal codes

Discrete Mathematics
Combinatorial theory (2nd ed.)

Combinatorial theory (2nd ed.)
Optimal (9v, 4, 1) Optical Orthogonal Codes

SIAM Journal on Discrete Mathematics
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
Some progress on (v, 4, 1) difference families and optical orthogonal codes

Journal of Combinatorial Theory Series A
Cyclic Difference Packing and Covering Arrays

Designs, Codes and Cryptography
A simulation model of an optical communication CDMA system

CompSysTech '07 Proceedings of the 2007 international conference on Computer systems and technologies
Bounds and constructions of optimal (n, 4, 2, 1) optical orthogonal codes

IEEE Transactions on Information Theory
New upper bound for (m, k, λ)-IRSs with λ ≥ 2

IEEE Transactions on Information Theory
On constructions for optimal two-dimensional optical orthogonal codes

Designs, Codes and Cryptography
Combinatorial constructions for optimal two-dimensional optical orthogonal codes

IEEE Transactions on Information Theory
Two-dimensional optical orthogonal codes and semicyclic group divisible designs

IEEE Transactions on Information Theory
New optimal variable-weight optical orthogonal codes

SETA'10 Proceedings of the 6th international conference on Sequences and their applications
Optimal partitioned cyclic difference packings for frequency hopping and code synchronization

IEEE Transactions on Information Theory
Constructions of covering arrays of strength five

Designs, Codes and Cryptography
Codes for optical CDMA

SETA'06 Proceedings of the 4th international conference on Sequences and Their Applications
Two classes of optimal two-dimensional OOCs

Designs, Codes and Cryptography
Semicyclic 4-GDDs and related two-dimensional optical orthogonal codes

Designs, Codes and Cryptography
New optimal optical orthogonal codes by restrictions to subgroups

Finite Fields and Their Applications

Quantified Score

Hi-index	0.30

Visualization

Abstract

In this paper two recursive constructions for optimal optical orthogonal codes are presented by means of incomplete difference matrices and perfect cyclic difference packings. These improve the known existence results concerning optimal (v,4,1)-OOCs.