Pairs in Nested Steiner Quadruple Systems
ABSTRACT Motivated by a repair problem for fractional repetition codes in distributed storage, each block of any Steiner quadruple system (SQS) of order is partitioned into two pairs. Each pair in such a partition is called a nested design pair, and its multiplicity is the number of times it is a pair in this partition. Such a partition of each block is considered a new block design called a nested SQS. Several related questions on this type of design are considered in this paper: What is the maximum multiplicity of the nested design pair with minimum multiplicity? What is the minimum multiplicity of the nested design pair with maximum multiplicity? Are there nested quadruple systems in which all the nested design pairs have the same multiplicity? Of special interest are nested quadruple systems in which all the pairs are nested design pairs with the same multiplicity. Several constructions of nested quadruple systems are considered, and in particular, classic constructions of SQS are examined.
Authors
- Son Hoang Dau (ORCID: https://orcid.org/0000-0002-2276-017X)
- Wenqin Zhang
- Tuvi Etzion (ORCID: https://orcid.org/0000-0002-4315-4400)
- Han Mao Kiah (ORCID: https://orcid.org/0000-0001-5611-0848)
- Yeow Meng Chee
Institutions
- National University of Singapore (SG)
- Nanyang Technological University (SG)
- Technion – Israel Institute of Technology (IL)
- Shanghai Jiao Tong University (CN)
- RMIT University (AU)
Publication Details
- Journal
- Journal of Combinatorial Designs
- Published
- 2025-02-20
- DOI
- https://doi.org/10.1002/jcd.21973
- Citations
- 1
- Primary Topic
- graph theory and CDMA systems
- Type
- article
- Field-Weighted Citation Impact
- 0.73