Optimal three-dimensional optical orthogonal codes of weight three

被引:9
|
作者
Shum, Kenneth W. [1 ]
机构
[1] Chinese Univ Hong Kong, Inst Network Coding, Shatin, Hong Kong, Peoples R China
关键词
Optical orthogonal codes; Constant-weight codes; Generalized Bhaskar Rao designs; Group divisible designs; COMBINATORIAL CONSTRUCTIONS; DESIGNS; FAMILIES;
D O I
10.1007/s10623-013-9894-4
中图分类号
TP301 [理论、方法];
学科分类号
081202 ;
摘要
Using polarization technique in optical code division multiple access, we can schedule the transmission of optical pulses in spatial domain, in addition to the frequency domain and time domain. An optical orthogonal code (OOC) which spreads in these dimensions is called a three-dimensional (3-D) OOC. In this paper, we study 3-D OOC with at most one optical pulse per wavelength/time plane, which have the favorable property that the Hamming auto-correlation is identically equal to 0. An upper bound on the number of codewords for general Hamming cross-correlation requirement is given. A 3-D OCC with at most one pulse per wavelength/time plane and Hamming cross-correlation no more than 1 is shown to be equivalent to a generalized Bhaskar Rao group divisible design (GBRGDD), signed over a cyclic group. Through this equivalence, necessary and sufficient conditions for the existence of GBRGDD of weighted 3, signed over a cyclic group, are derived.
引用
收藏
页码:109 / 126
页数:18
相关论文
共 50 条
  • [1] Optimal three-dimensional optical orthogonal codes of weight three
    Kenneth W. Shum
    Designs, Codes and Cryptography, 2015, 75 : 109 - 126
  • [2] Combinatorial Constructions of Optimal Three-Dimensional Optical Orthogonal Codes
    Wang, Lidong
    Chang, Yanxun
    IEEE TRANSACTIONS ON INFORMATION THEORY, 2015, 61 (01) : 671 - 687
  • [3] Determination of Sizes of Optimal Three-Dimensional Optical Orthogonal Codes of Weight Three with the AM-OPP Restriction
    Wang, Lidong
    Chang, Yanxun
    JOURNAL OF COMBINATORIAL DESIGNS, 2017, 25 (07) : 310 - 334
  • [4] Three-dimensional Optical Orthogonal Signature Pattern Codes for OCDMA
    Xu, Dandan
    Chen, Bei
    Xu, Bing
    2016 8TH INTERNATIONAL CONFERENCE ON INTELLIGENT HUMAN-MACHINE SYSTEMS AND CYBERNETICS (IHMSC), VOL. 2, 2016, : 500 - 503
  • [5] Three New Families of Optimal Variable-Weight Optical Orthogonal Codes
    Chung, Jin-Ho
    Yang, Kyeongcheol
    2015 IEEE INTERNATIONAL SYMPOSIUM ON INFORMATION THEORY (ISIT), 2015, : 1546 - 1550
  • [6] Three-dimensional orthogonal complete complementary codes
    Turcsány, M
    Farkas, P
    SYMPOTIC '04: JOINT IST WORKSHOP ON MOBILE FUTURE & SYMPOSIUM ON TRENDS IN COMMUNICATIONS, PROCEEDINGS, 2004, : 98 - 101
  • [7] New asymptotically optimal three-dimensional wave-length/space/time optical orthogonal codes for OCDMA systems
    Ortiz-Ubarri, Jose
    CRYPTOGRAPHY AND COMMUNICATIONS-DISCRETE-STRUCTURES BOOLEAN FUNCTIONS AND SEQUENCES, 2020, 12 (04): : 785 - 794
  • [8] New asymptotically optimal three-dimensional wave-length/space/time optical orthogonal codes for OCDMA systems
    José Ortiz-Ubarri
    Cryptography and Communications, 2020, 12 : 785 - 794
  • [9] Three-dimensional orthogonal graph drawing with optimal volume
    Biedl, T
    Thiele, T
    Wood, DR
    ALGORITHMICA, 2006, 44 (03) : 233 - 255
  • [10] Three-Dimensional Orthogonal Graph Drawing with Optimal Volume
    Therese Biedl
    Torsten Thiele
    David R. Wood
    Algorithmica, 2006, 44 : 233 - 255