Two classes of optimal two-dimensional OOCs

Authors:
Yuemei Huang;Yanxun Chang
Affiliations:
Institute of Mathematics, Beijing Jiaotong University, Beijing, People's Republic of China 100044;Institute of Mathematics, Beijing Jiaotong University, Beijing, People's Republic of China 100044
Venue:
Designs, Codes and Cryptography
Year:
2012

Citing 16
Cited 1

Some combinational constructions for optical orthogonal codes

Discrete Mathematics
Cyclic Designs with Block Size 4 and Related Optimal Optical Orthogonal Codes

Designs, Codes and Cryptography
Construction for optimal optical orthogonal codes

Discrete Mathematics - Papers on the occasion of the 65th birthday of Alex Rosa
Combinatorial Designs: Constructions and Analysis

Combinatorial Designs: Constructions and Analysis
Some progress on (v, 4, 1) difference families and optical orthogonal codes

Journal of Combinatorial Theory Series A
Constructions for strictly cyclic 3-designs and applications to optimal OOCs with λ=2

Journal of Combinatorial Theory Series A
2-dimensional optical orthogonal codes from singer groups

Discrete Applied Mathematics
Bounds and constructions of optimal (n, 4, 2, 1) optical orthogonal codes

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
Spectral classification and multiplicative partitioning of constant-weight sequences based on circulant matrix representation of optical orthogonal codes

IEEE Transactions on Information Theory
Optical orthogonal codes: their bounds and new optimal constructions

IEEE Transactions on Information Theory
Constructions for optimal (υ, 4, 1) optical orthogonal codes

IEEE Transactions on Information Theory
Combinatorial constructions of optimal optical orthogonal codes with weight 4

IEEE Transactions on Information Theory
A new class of optimal optical orthogonal codes with weight five

IEEE Transactions on Information Theory
Families of Optimal OOCs With

IEEE Transactions on Information Theory

Combinatorial constructions for optimal 2-D optical orthogonal codes with AM-OPPTS property

Designs, Codes and Cryptography

Quantified Score

Hi-index	0.00

Visualization

Abstract

Let 驴(u 脳 v, k, 驴 a , 驴 c ) denote the largest possible size among all 2-D (u 脳 v, k, 驴 a , 驴 c )-OOCs. In this paper, the exact value of 驴(u 脳 v, k, 驴 a , k 驴 1) for 驴 a = k 驴 1 and k is determined. The case 驴 a = k 驴 1 is a generalization of a result in Yang (Inform Process Lett 40:85---87, 1991) which deals with one dimensional OOCs namely, u = 1.