Semi-cyclic holey group divisible designs with block size three and applications to sampling designs and optical orthogonal codes

2014/04/27 by Tao Feng, Xiaomiao Wang, Feng, Tao +3
Engineering · Mathematics · Medicine · #Combinatorics (math.CO) #FOS: Mathematics #HER2/EGFR in Cancer Research #Monoclonal and Polyclonal Antibodies Research #graph theory and CDMA systems #math.CO

paper · pdf · doi:10.48550/arxiv.1404.6800

arXiv admin note: substantial text overlap with arXiv:1304.3282

openalex publication_date 2014/04/27 · arxiv created 2014/10/22 · arxiv updated 2014/10/23 · openalex created_date 2016/06/24 · openalex updated_date 2026/07/28

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≠ 8 or t is doubly even and t≠ 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.

Citations

• Semi-cyclic holey group divisible designs with block size three

Related

• Maximum w-cyclic holely group divisible packings with block size three\n and applications to optical orthogonal codes
• Group divisible designs with block size 4 and group sizes 4 and 7
• Group Divisible Designs with λ₁=3 and Large Second Index
• Group divisible designs with block size four and type g^u m¹ - III
• A family of group divisible designs with arbitrary block sizes