English

Maximum $w$-cyclic holely group divisible packings with block size three and applications to optical orthogonal codes

Combinatorics 2020-06-15 v1 Information Theory math.IT

Abstract

In this paper we investigate combinatorial constructions for ww-cyclic holely group divisible packings with block size three (briefly by 33-HGDPs). For any positive integers u,v,wu,v,w with u0,1 (mod 3)u\equiv0,1~(\bmod~3), the exact number of base blocks of a maximum ww-cyclic 33-HGDP of type (u,wv)(u,w^v) is determined. This result is used to determine the exact number of codewords in a maximum three-dimensional (u×v×w,3,1)(u\times v\times w,3,1) optical orthogonal code with at most one optical pulse per spatial plane and per wavelength plane.

Keywords

Cite

@article{arxiv.2006.06921,
  title  = {Maximum $w$-cyclic holely group divisible packings with block size three and applications to optical orthogonal codes},
  author = {Zenghui Fang and Junling Zhou and Lidong Wang},
  journal= {arXiv preprint arXiv:2006.06921},
  year   = {2020}
}

Comments

33 pages