A family of group divisible designs with arbitrary block sizes
From MaRDI portal
Publication:2279385
DOI10.11650/TJM/190104zbMATH Open1446.05010arXiv1712.02155OpenAlexW2795505507MaRDI QIDQ2279385FDOQ2279385
Authors: Yaotsu Chang, Chong-Dao Lee, Yu-Pei Huang, Chia-An Liu
Publication date: 12 December 2019
Published in: Taiwanese Journal of Mathematics (Search for Journal in Brave)
Abstract: Recently, a construction of group divisible designs (GDDs) derived from the decoding of quadratic residue (QR) codes was given. In this paper, we extend the idea to obtain a new family of GDDs, which is also involved with a well-known balanced incomplete block design (BIBD).
Full work available at URL: https://arxiv.org/abs/1712.02155
Recommendations
Combinatorial aspects of block designs (05B05) Theory of error-correcting codes and error-detecting codes (94B99)
Cites Work
- Combinatorial Designs
- The CRC handbook of combinatorial designs
- New 5-designs
- Title not available (Why is that?)
- Group divisible designs with two associate classes: \(n=2\) or \(m=2\)
- Odd and even group divisible designs with two groups and block size four
- Title not available (Why is that?)
- Perfect binary codes: constructions, properties, and enumeration
- Title not available (Why is that?)
- Group Divisible Codes and Their Application in the Construction of Optimal Constant-Composition Codes of Weight Three
- Symmetry codes over GF(3) and new five-designs
- More results on the existence of simple BIBDs with number of elements a prime power
- On the Weight Distributions of Cosets of a Linear Code
- Group divisible designs with large block sizes
- Design theory
- A construction of group divisible designs with block sizes 3 to 7
- On the existence of simple BIBDs with number of elements a prime power
Cited In (5)
This page was built for publication: A family of group divisible designs with arbitrary block sizes
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2279385)