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 -cyclic holely group divisible packings with block size three (briefly by -HGDPs). For any positive integers with , the exact number of base blocks of a maximum -cyclic -HGDP of type is determined. This result is used to determine the exact number of codewords in a maximum three-dimensional 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