New Optimal Variable-Weight Optical Orthogonal Codes

Wu, Dianhua; Cao, Jiayun; Fan, Pingzhi

doi:10.1007/978-3-642-15874-2_8

Cited by 2 publications

(1 citation statement)

References 25 publications

Supporting

Mentioning

Contrasting

Order By: Relevance

“…{ }, 1, 1/2, 1/2 { })-OOCs and (41p, 5, 7 { }, 1, 2/3, 1/3 { })-OOCs, for any prime p ≡ 3(mod4) and p ≥ 7. In addition, referring to [34,35], for 1 ≤ t < p − 1/2, if we break t blocks of size 7 into 3 of (31p, 5…”

Section: Discussionmentioning

confidence: 99%

Constructions of Optimal Optical Orthogonal Codes with Weights Set $\{5,7\}$ via Cyclic Packing

Huang

Luo

Wang

2022

Mathematical Problems in Engineering

View full text Add to dashboard Cite

Double-weight optical orthogonal codes are variable-weight optical orthogonal codes (OOCs), which have been widely applied in optical networks and systems. Some works have been devoted to optimal n , W , 1 , Q -OOCs with max w : w ∈ W ≤ 6 . So far, there is no explicit construction of optimal n , W , 1 , Q -OOCs with W = 5,7 . It is known that heavier-weight codewords have better code performance than lighter-weight codewords. So, in this paper, we use cyclic packing to construct two infinite classes of optimal OOCs with weights set 5,7 explicitly, for any prime p ≡ 3 mod 4 and p ≥ 7 . In addition, for 1 ≤ t < p − 1 / 2 , by breaking t blocks of size 7 into 3 of 31 p , 5,7 , 1 , 1 / 2 , 1 / 2 -OOCs and 41 p , 5,7 , 1 , 2 / 3 , 1 / 3 -OOCs, we obtain new infinite classes of optimal 31 p , 3,5,7 , 1 , 7 t / p − 1 + 6 t , p − 1 / 2 p − 1 + 6 t , p − 1 − 2 t / 2 p − 1 + 6 t -OOCs and 41 p , 3,5,7 , 1 , 14 t / 3 p − 1 + 4 t , 2 p − 1 / 3 p − 1 + 4 t , p − 1 − 2 t / 3 p − 1 + 4 t -OOCs, respectively.

show abstract

Section: Discussionmentioning

confidence: 99%