New Constructions of Optimal Optical Orthogonal Codes Based on Partitionable Sets and Almost Partitionable Sets

被引：0
|
作者：
Wang, Zijing [1 ]
Kong, Hairong [1 ]
机构：
[1] Hebei Univ Technol, Sch Sci, Tianjin 300401, Peoples R China
来源：
IEEE TRANSACTIONS ON INFORMATION THEORY | 2023年 / 69卷 / 04期
关键词：
Codes; Additives; Optical design; Multiaccess communication; Indexes; Upper bound; Quality of service; Cyclic packing; optical orthogonal code; partitionable set; almost partitionable set; variable-weight optical orthogonal code; MULTIPLE-ACCESS TECHNIQUES; FIBER NETWORKS; SPECTRUM;
D O I：
10.1109/TIT.2022.3177690
中图分类号：
TP [自动化技术、计算机技术];
学科分类号：
0812 ;
摘要：
Variable-weight optical orthogonal codes (OOCs) were introduced by Yang for multimedia optical CDMA systems with multiple quality of service (QoS) requirements. In this paper, partitionable sets and almost partitionable sets are used to construct variable-weight OOCs. Four new recursive constructions for optimal cyclic packing are presented. Consequently, new infinite classes of optimal (v,W,1,Q)-OOCs are obtained.
引用
收藏
页码：2355 / 2363
页数：9
相关论文
共 50 条
12345