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 条
  • [1] Partitionable sets, almost partitionable sets, and their applications
    Chang, Yanxun
    Costa, Simone
    Feng, Tao
    Wang, Xiaomiao
    JOURNAL OF COMBINATORIAL DESIGNS, 2020, 28 (11) : 783 - 813
  • [2] New constructions for optical orthogonal codes, distinct difference sets and synchronous optical orthogonal codes
    Moreno, O
    Kumar, PV
    Lu, HF
    Omrani, R
    2003 IEEE INTERNATIONAL SYMPOSIUM ON INFORMATION THEORY - PROCEEDINGS, 2003, : 327 - 327
  • [3] NON-PARTITIONABLE POINT SETS
    AVIS, D
    INFORMATION PROCESSING LETTERS, 1984, 19 (03) : 125 - 129
  • [4] Large sets of t-designs through partitionable sets:: A survey
    Khosrovshahi, G. B.
    Tayfeh-Rezaie, B.
    DISCRETE MATHEMATICS, 2006, 306 (23) : 2993 - 3004
  • [5] A New Construction of Optimal Optical Orthogonal Codes From Sidon Sets
    Ruiz, Hamilton M.
    Delgado, Luis M.
    Trujillo, Carlos A.
    IEEE ACCESS, 2020, 8 : 100749 - 100753
  • [6] Partitionable sets and cyclic BSECs with block size four
    Zhang, Jing
    Chang, Yanxun
    JOURNAL OF STATISTICAL PLANNING AND INFERENCE, 2009, 139 (06) : 1974 - 1979
  • [7] Optical orthogonal codes: Their bounds and new optimal constructions
    Fuji-Hara, R
    Miao, Y
    IEEE TRANSACTIONS ON INFORMATION THEORY, 2000, 46 (07) : 2396 - 2406
  • [8] Constructions for optimal optical orthogonal codes
    Chang, YX
    Miao, Y
    DISCRETE MATHEMATICS, 2003, 261 (1-3) : 127 - 139
  • [9] Constructions for new orthogonal arrays based on large sets of orthogonal arrays
    Guangzhou Chen
    Xiaodong Niu
    Designs, Codes and Cryptography, 2023, 91 : 2605 - 2625
  • [10] Constructions for new orthogonal arrays based on large sets of orthogonal arrays
    Chen, Guangzhou
    Niu, Xiaodong
    DESIGNS CODES AND CRYPTOGRAPHY, 2023, 91 (07) : 2605 - 2625
12345