Semi-cyclic holey group divisible designs with block size three and applications to sampling designs and optical orthogonal codes
Combinatorics
2014-10-23 v2
Abstract
We consider the existence problem for a semi-cyclic holey group divisible design of type (n,m^t) with block size 3, which is denoted by a 3-SCHGDD of type (n,m^t). When t is odd and n\neq 8 or t is doubly even and t\neq 8, the existence problem is completely solved; when t is singly even, many infinite families are obtained. Applications of our results to two-dimensional balanced sampling plans and optimal two-dimensional optical orthogonal codes are also discussed.
Keywords
Cite
@article{arxiv.1404.6800,
title = {Semi-cyclic holey group divisible designs with block size three and applications to sampling designs and optical orthogonal codes},
author = {Tao Feng and Xiaomiao Wang and Ruizhong Wei},
journal= {arXiv preprint arXiv:1404.6800},
year = {2014}
}
Comments
arXiv admin note: substantial text overlap with arXiv:1304.3282